2005 |
8 | EE | Neal Madras,
C. Chris Wu:
Self-Avoiding Walks on Hyperbolic Graphs.
Combinatorics, Probability & Computing 14(4): 523-548 (2005) |
2003 |
7 | EE | Neal Madras,
Zhongrong Zheng:
On the swapping algorithm.
Random Struct. Algorithms 22(1): 66-97 (2003) |
1996 |
6 | | Neal Madras,
Dana Randall:
Factoring Graphs to Bound Mixing Rates.
FOCS 1996: 194-203 |
1992 |
5 | EE | Albert G. Greenberg,
Neal Madras:
How Fair is Fair Queuing?
J. ACM 39(3): 568-598 (1992) |
1990 |
4 | | Albert G. Greenberg,
Neal Madras:
Comparison of a Fair Queueing Discipline to Processor Sharing.
Performance 1990: 193-207 |
1989 |
3 | | Richard M. Karp,
Michael Luby,
Neal Madras:
Monte-Carlo Approximation Algorithms for Enumeration Problems.
J. Algorithms 10(3): 429-448 (1989) |
1988 |
2 | EE | Jonathan Goodman,
Albert G. Greenberg,
Neal Madras,
Peter March:
Stability of binary exponential backoff.
J. ACM 35(3): 579-602 (1988) |
1985 |
1 | | Jonathan Goodman,
Albert G. Greenberg,
Neal Madras,
Peter March:
On the Stability of the Ethernet
STOC 1985: 379-387 |