Edward M. Reingold

According to our database1, Edward M. Reingold
  • authored at least 63 papers between 1970 and 2014.
  • has a "Dijkstra number"2 of three.

Awards

ACM Fellow

ACM Fellow 1996, "For significant research and educational contributions to data structures and the analysis of combinatorial algorithms.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2014
Four Apt Elementary Examples of Recursion.
Proceedings of the Language, Culture, Computation. Computing - Theory and Technology, 2014

Basic Techniques for Design and Analysis of Algorithms.
Proceedings of the Computing Handbook, 2014

2013
Analysis of Boyer and Moore's MJRTY algorithm.
Inf. Process. Lett., 2013

2012
Modulo intervals: a proposed notation.
SIGACT News, 2012

2011
Improved bounds for cops-and-robber pursuit.
Comput. Geom., 2011

2010
Bounds for cops and robber pursuit.
Comput. Geom., 2010

2009
Average-case analysis of some plurality algorithms.
ACM Trans. Algorithms, 2009

2008
Average-case lower bounds for the plurality problem.
ACM Trans. Algorithms, 2008

Determining plurality.
ACM Trans. Algorithms, 2008

Calendrical calculations (3. ed.).
Cambridge University Press, ISBN: 978-0-521-88540-9, 2008

2004
The worst-case chip problem.
Inf. Process. Lett., 2004

Line drawing, leap years, and Euclid.
ACM Comput. Surv., 2004

Quicksort with Unreliable Comparisons: A Probabilistic Analysis.
Combinatorics, Probability & Computing, 2004

2002
Index assignment for multichannel communication under failure.
IEEE Trans. Information Theory, 2002

Calendrical Tabulations - 1900 - 2200.
Cambridge University Press, ISBN: 978-0-521-78253-1, 2002

Calendrical calcuations - the millenium edition.
Cambridge University Press, ISBN: 978-0-521-77752-0, 2002

2000
A potential-based amortized analysis of the union-find data structure.
SIGACT News, 2000

Index Assignment for Multichannel Communication under Failure
CoRR, 2000

1999
Optimal Multichannel Communication Under Failure.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1997
The Average-Case Complexity of Determining the Majority.
SIAM J. Comput., 1997

K-M-P String Matching Revisited.
Inf. Process. Lett., 1997

Basic Techniques for Design and Analysis of Algorithms.
Proceedings of the Computer Science and Engineering Handbook, 1997

1996
Generalized Kraft's Inequality and Discrete k-Modal Search.
SIAM J. Comput., 1996

Basic Techniques for Design and Analysis of Algorithms.
ACM Comput. Surv., 1996

1995
The Complexity of Pursuit on a Graph.
Theor. Comput. Sci., 1995

Multidimensional Divide-and-Conquer Maximin Recurrences.
SIAM J. Discrete Math., 1995

1994
Efficient Management of Dynamic Tables.
Inf. Process. Lett., 1994

1993
Calendrical Calculations, II: Three Historical Calendars.
Softw., Pract. Exper., 1993

A Fibonacci Version of Kraft's Inequality Applied to Discrete Unimodal Search.
SIAM J. Comput., 1993

Determining the Majority.
Inf. Process. Lett., 1993

1992
"Lion and Man": Upper and Lower Bounds.
INFORMS Journal on Computing, 1992

Ordinal Arithmetic with List Structures.
Proceedings of the Logical Foundations of Computer Science, 1992

1991
Graph Drawing by Force-directed Placement.
Softw., Pract. Exper., 1991

More Nearly Optimal Algorithms for Unbounded Searching, Part II: The Transfinite Case.
SIAM J. Comput., 1991

More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case.
SIAM J. Comput., 1991

Scheduling on a Hypercube.
Inf. Process. Lett., 1991

Probabilistic Analysis of a Grouping Algorithm.
Algorithmica, 1991

Stochastic Rearrangement Rules for Self-Organizing Data Structures.
Algorithmica, 1991

1990
Calendrical Calculations.
Softw., Pract. Exper., 1990

1989
Solution of a Divide-and-Conquer Maximin Recurrence.
SIAM J. Comput., 1989

Optimum lopsided binary trees.
J. ACM, 1989

1984
A Hierarchy-Driven Amalgamation of Standard and Macro Cells.
IEEE Trans. on CAD of Integrated Circuits and Systems, 1984

1983
The Travelling Salesman Problem and Minimum Matching in the Unit Square.
SIAM J. Comput., 1983

Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching.
SIAM J. Comput., 1983

Probabilistic analysis of divide-and-conquer heuristics for minimum weighted euclidean matching.
Networks, 1983

1982
Aspects of insertion in random trees.
Computing, 1982

The Complexity of Drawing Trees Nicely.
Acta Inf., 1982

1981
Tidier Drawings of Trees.
IEEE Trans. Software Eng., 1981

On a Greedy Heuristic for Complete Matching.
SIAM J. Comput., 1981

A Comment on the Evaluation of Polish Postfix Expressions.
Comput. J., 1981

1980
Heuristics for Weighted Perfect Matching
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1977
Understanding the Complexity of Interpolation Search.
Inf. Process. Lett., 1977

1976
Efficient Generation of the Binary Reflected Gray Code and Its Applications.
Commun. ACM, 1976

1975
Backtrack Programming Techniques.
Commun. ACM, 1975

1973
Binary Search Trees of Bounded Balance.
SIAM J. Comput., 1973

A Nonrecursive List Moving Algorithm.
Commun. ACM, 1973

1972
Infix to Prefix Translation: The Insufficiency of a Pushdown Stack.
SIAM J. Comput., 1972

On the Time Required to Detect Cycles and Connectivity in Graphs.
Mathematical Systems Theory, 1972

On the Optimality of Some Set Algorithms.
J. ACM, 1972

Binary Search Trees of Bounded Balance
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

Simple Proofs of Lower Bounds for Polynomial Evaluation.
Proceedings of a symposium on the Complexity of Computer Computations, 1972

1971
Computing the Maximum and the Median
Proceedings of the 12th Annual Symposium on Switching and Automata Theory, 1971

1970
On the Optimality of Some Set and Vector Algorithms
Proceedings of the 11th Annual Symposium on Switching and Automata Theory, 1970


  Loading...