 | 2009 |
|---|
| 9 |       | Nikolai Slobodianik,
Dmitry Zaporozhets,
Neal Madras:
Strong Limit Theorems for the Bayesian Scoring Criterion in Bayesian Networks.
Journal of Machine Learning Research 10: 1511-1526 (2009) |
| 2005 |
|---|
| 8 | | Neal Madras,
C. Chris Wu:
Self-Avoiding Walks on Hyperbolic Graphs.
Combinatorics, Probability & Computing 14(4): 523-548 (2005) |
| 2003 |
|---|
| 7 | | 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 | | 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 | | 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 |
Data released under the ODC-BY 1.0 license — See also our legal information page