Search the dblp DataBase
Neal Madras: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Neal Madras, Dana Randall
Factoring Graphs to Bound Mixing Rates. [Citation Graph (0, 0)][DBLP]
FOCS, 1996, pp:194-203 [Conf] - Albert G. Greenberg, Neal Madras
Comparison of a Fair Queueing Discipline to Processor Sharing. [Citation Graph (0, 0)][DBLP]
Performance, 1990, pp:193-207 [Conf] - Jonathan Goodman, Albert G. Greenberg, Neal Madras, Peter March
On the Stability of the Ethernet [Citation Graph (0, 0)][DBLP]
STOC, 1985, pp:379-387 [Conf] - Neal Madras, C. Chris Wu
Self-Avoiding Walks on Hyperbolic Graphs. [Citation Graph (0, 0)][DBLP]
Combinatorics, Probability & Computing, 2005, v:14, n:4, pp:523-548 [Journal] - Jonathan Goodman, Albert G. Greenberg, Neal Madras, Peter March
Stability of binary exponential backoff. [Citation Graph (0, 0)][DBLP]
J. ACM, 1988, v:35, n:3, pp:579-602 [Journal] - Albert G. Greenberg, Neal Madras
How Fair is Fair Queuing? [Citation Graph (0, 0)][DBLP]
J. ACM, 1992, v:39, n:3, pp:568-598 [Journal] - Richard M. Karp, Michael Luby, Neal Madras
Monte-Carlo Approximation Algorithms for Enumeration Problems. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1989, v:10, n:3, pp:429-448 [Journal] - Neal Madras, Zhongrong Zheng
On the swapping algorithm. [Citation Graph (0, 0)][DBLP]
Random Struct. Algorithms, 2003, v:22, n:1, pp:66-97 [Journal]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002