A. G. Greenberg

From MaRDI portal
(Redirected from A. G. Greenberg)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
An approximate model of processor communication rings under heavy load
Information Processing Letters
2016-05-26Paper
Quicker Convergence for Iterative Numerical Solutions to Stochastic Problems: Probabilistic Interpretations, Ordering Heuristics, and Parallel Processing
Probability in the Engineering and Informational Sciences
2007-01-19Paper
Superfast parallel discrete event simulations
ACM Transactions on Modeling and Computer Simulation
1998-02-05Paper
Synchronous relaxation for parallel simulations with applications to circuit-switched networks
ACM Transactions on Modeling and Computer Simulation
1996-06-24Paper
Queues served by a rotating ring
Communications in Statistics. Stochastic Models
1996-01-15Paper
How fair is fair queuing
Journal of the ACM
1994-11-13Paper
Sharp approximate models of deflection routing in mesh networks
IEEE Transactions on Communications
1993-08-16Paper
Deflection routing in hypercube networks
IEEE Transactions on Communications
1993-01-16Paper
A flexible way of counting large numbers approximately in small registers
Algorithmica
1992-06-25Paper
scientific article; zbMATH DE number 4133492 (Why is no real title available?)1990-01-01Paper
Estimating the multiplicities of conflicts to speed their resolution in multiple access channels
Journal of the ACM
1987-01-01Paper
A lower bound for probabilistic algorithms for finite state machines
Journal of Computer and System Sciences
1986-01-01Paper
A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
Journal of the ACM
1985-01-01Paper
An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
IEEE Transactions on Information Theory
1985-01-01Paper
Efficient parallel algorithms for linear recurrence computation
Information Processing Letters
1982-01-01Paper


Research outcomes over time


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