A. G. Greenberg

Available identifiers

Publication	Date of Publication	Type
An approximate model of processor communication rings under heavy load	2016-05-26	Paper
Quicker Convergence for Iterative Numerical Solutions to Stochastic Problems: Probabilistic Interpretations, Ordering Heuristics, and Parallel Processing	2007-01-19	Paper
Superfast parallel discrete event simulations	1998-02-05	Paper
Synchronous relaxation for parallel simulations with applications to circuit-switched networks	1996-06-24	Paper
Queues served by a rotating ring	1996-01-15	Paper
How fair is fair queuing	1994-11-13	Paper
Sharp approximate models of deflection routing in mesh networks	1993-08-16	Paper
Deflection routing in hypercube networks	1993-01-16	Paper
A flexible way of counting large numbers approximately in small registers	1992-06-25	Paper
https://portal.mardi4nfdi.de/entity/Q3034818	1990-01-01	Paper
Estimating the multiplicities of conflicts to speed their resolution in multiple access channels	1987-01-01	Paper
A lower bound for probabilistic algorithms for finite state machines	1986-01-01	Paper
A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels	1985-01-01	Paper
An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels	1985-01-01	Paper
Efficient parallel algorithms for linear recurrence computation	1982-01-01	Paper

This page was built for person: A. G. Greenberg