Neal Madras

According to our database1, Neal Madras authored at least 14 papers between 1985 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Bounded affine permutations I. Pattern avoidance and enumeration.
Discret. Math. Theor. Comput. Sci., 2021

2017
Longest Monotone Subsequences and Rare Regions of Pattern-Avoiding Permutations.
Electron. J. Comb., 2017

2016
Structure of random 312-avoiding permutations.
Random Struct. Algorithms, 2016

Large Deviations for Permutations Avoiding Monotone Patterns.
Electron. J. Comb., 2016

2014
Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations.
Comb. Probab. Comput., 2014

2009
Strong Limit Theorems for the Bayesian Scoring Criterion in Bayesian Networks.
J. Mach. Learn. Res., 2009

2005
Self-Avoiding Walks on Hyperbolic Graphs.
Comb. Probab. Comput., 2005

2003
On the swapping algorithm.
Random Struct. Algorithms, 2003

1996
Factoring Graphs to Bound Mixing Rates.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1992
How Fair is Fair Queuing?
J. ACM, 1992

1990
Comparison of a Fair Queueing Discipline to Processor Sharing.
Proceedings of the Performance '90, 1990

1989
Monte-Carlo Approximation Algorithms for Enumeration Problems.
J. Algorithms, 1989

1988
Stability of binary exponential backoff.
J. ACM, 1988

1985
On the Stability of the Ethernet
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985


  Loading...