Result for query "Greenberg"
- David S. Greenberg and Lenwood S. Heath and Arnold L. Rosenberg.
Optimal embeddings of butterfly-like graphs in the hypercube.
Mathematical Systems Theory, 23(1):61-77, 1990.
[Reference in context]
[BibTeX record]
- David S. Greenberg and Sandeep N. Bhatt.
Routing multiple paths in hypercubes.
Mathematical Systems Theory, 24(4):295-321, 1991.
[Reference in context]
[BibTeX record]
- Stephen G. Eick and Albert G. Greenberg and Boris D. Lubachevsky and Alan Weiss.
Synchronous relaxation for parallel simulations with applications to circuit-switched networks.
ACM Transactions on Modeling and Computer Simulation, 3(4):287-314, October 1993.
[Reference in context]
[BibTeX record]
- Albert G. Greenberg and Boris D. Lubachevsky and Isi Mitrani.
Superfast parallel discrete event simulations.
ACM Transactions on Modeling and Computer Simulation, 6(2):107-136, April 1996.
[Reference in context]
[BibTeX record]
- Albert G. Greenberg and Boris D. Lubachevsky and Andrew M. Odlyzko.
Simple, efficient asynchronous parallel algorithms for maximization.
ACM Transactions on Programming Languages and Systems, 10(2):313-337, April 1988.
[Reference in context]
[BibTeX record]
- P. R. Cohen and M. Greenberg and J. DeLisio.
MU: A development environment for prospective reasoning systems.
In K. S. H. Forbus, editor, Proceedings of the 6th National Conference on Artificial Intelligence, pages 783-788, Seattle, Washington, July 1987. Morgan Kaufmann.
[Reference in context]
[BibTeX record]
- Albert C. Greenberg and Richard E. Ladner and Michael S. Paterson and Zvi Galil.
Efficient parallel algorithms for linear recurrence computation.
Information Processing Letters, 15(1):31-35, 19 August 1982.
[Reference in context]
[BibTeX record]
- M. J. Foster and Ronald I. Greenberg.
Lower bounds on the area of finite-state machines.
Information Processing Letters, 30(1):1-7, 16 January 1989.
[Reference in context]
[BibTeX record]
- Ronald I. Greenberg and F. Miller Maley.
Minimum separation for single-layer channel routing.
Information Processing Letters, 43(4):201-205, 28 September 1992.
[Reference in context]
[BibTeX record]
- Ronald Greenberg and Joseph Jájá and Sridhar Krishnamurthy.
On the difficulty of Manhattan channel routing.
Information Processing Letters, 44(5):281-284, 21 December 1992.
[Reference in context]
[BibTeX record]
- Albert G. Greenberg and Shmuel Winograd.
A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels.
Journal of the ACM, 32(3):589-596, July 1985.
[Reference in context]
[BibTeX record]
- Albert G. Greenberg and Philippe Flajolet and Richard E. Ladner.
Estimating the multiplicities of conflicts to speed their resolution in multiple access channels.
Journal of the ACM, 34(2):289-325, April 1987.
[Reference in context]
[BibTeX record]
- Jonathan Goodman and Albert G. Greenberg and Neal Madras and Peter March.
Stability of binary exponential backoff.
Journal of the ACM, 35(3):579-602, July 1988.
[Reference in context]
[BibTeX record]
- Albert G. Greenberg and Neal Madras.
How fair is fair queuing?
Journal of the ACM, 39(3):568-598, July 1992.
[Reference in context]
[BibTeX record]
- Yehuda Afek and David S. Greenberg and Michael Merritt and Gadi Taubenfeld.
Computing with faulty shared ojects.
Journal of the ACM, 42(6):1231-1274, November 1995.
[Reference in context]
[BibTeX record]
- Albert G. Greenberg.
On the time complexity of broadcast communication schemes (preliminary version).
In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pages 354-364, San Francisco, California, 5-7 May 1982.
[Reference in context]
[BibTeX record]
- Jonathan Goodman and Albert G. Greenberg and Neal Madras and Peter March.
On the stability of the ethernet.
In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pages 379-387, Providence, Rhode Island, 6-8 May 1985.
[Reference in context]
[BibTeX record]
- Ronald I. Greenberg and H.-C. Oh.
Packet routing in networks with long wires.
Journal of Parallel and Distributed Computing, 31(2):153-158, December 1995.
[Reference in context]
[BibTeX record]
- David S. Greenberg and James K. Park and Eric J. Schwabe.
The cost of complex communication on simple networks.
Journal of Parallel and Distributed Computing, 35(2):133-141, 15 June 1996.
[Reference in context]
[BibTeX record]
- Albert G. Greenberg and Boris D. Lubachevsky and Isi Mitrani.
Algorithms for unboundedly parallel simulations.
ACM Transactions on Computer Systems, 9(3):201-221, August 1991.
[Reference in context]
[BibTeX record]
- Albert G. Greenberg and Richard E. Ladner.
Estimating the multiplicities of conflicts in multiple access channels (preliminary report).
In 24th Annual Symposium on Foundations of Computer Science, pages 383-392, Tucson, Arizona, 7-9 November 1983. IEEE.
[Reference in context]
[BibTeX record]
- Albert G. Greenberg and Alan Weiss.
A lower bound for probabilistic algorithms for finite state machines.
In 25th Annual Symposium on Foundations of Computer Science, pages 323-331, Singer Island, Florida, 24-26 October 1984. IEEE.
[Reference in context]
[BibTeX record]
- Ronald I. Greenberg and Charles E. Leiserson.
Randomized routing on fat-trees (preliminary version).
In 26th Annual Symposium on Foundations of Computer Science, pages 241-249, Portland, Oregon, 21-23 October 1985. IEEE.
[Reference in context]
[BibTeX record]
- Sandeep Bhatt and David Greenberg and Tom Leighton and Pangfeng Liu.
Tight bounds for on-line tree embeddings.
In Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, pages 344-350, San Francisco, California, 28-30 January 1991.
[Reference in context]
[BibTeX record]
- Albert G. Greenberg and Alan Weiss.
A lower bound for probabilistic algorithms for finite state machines.
Journal of Computer and System Sciences, 33(1):88-105, August 1986.
[Reference in context]
[BibTeX record]
Summary for query "Greenberg":
found 28 matches in 14 bibliographies