Edward M. Reingold

67 papers A* 3A 1Misc 1Journal 50Unranked 5
YearRankTypeTitle / Venue / Authors
2014 — ch.
Basic Techniques for Design and Analysis of Algorithms.
Computing Handbook, 3rd ed. (1)
Edward M. Reingold
2014 — conf
Four Apt Elementary Examples of Recursion.
Language, Culture, Computation (1)
Edward M. Reingold
2013 J jnl
Analysis of Boyer and Moore's MJRTY algorithm.
Inf. Process. Lett.
Laurent Alonso, Edward M. Reingold
2012 J jnl
Modulo intervals: a proposed notation.
SIGACT News
Nachum Dershowitz, Edward M. Reingold
2011 J jnl
Improved bounds for cops-and-robber pursuit.
Comput. Geom.
Laurent Alonso, Edward M. Reingold
2010 J jnl
Bounds for cops and robber pursuit.
Comput. Geom.
Laurent Alonso, Edward M. Reingold
2009 J jnl
Average-case analysis of some plurality algorithms.
ACM Trans. Algorithms
Laurent Alonso, Edward M. Reingold
2008 J jnl
Average-case lower bounds for the plurality problem.
ACM Trans. Algorithms
Laurent Alonso, Edward M. Reingold
2008 — book
Calendrical calculations (3. ed.).
Nachum Dershowitz, Edward M. Reingold
2008 J jnl
Determining plurality.
ACM Trans. Algorithms
Laurent Alonso, Edward M. Reingold
2004 J jnl
Line drawing, leap years, and Euclid.
ACM Comput. Surv.
Mitchell A. Harris, Edward M. Reingold
2004 J jnl
Quicksort with Unreliable Comparisons: A Probabilistic Analysis.
Comb. Probab. Comput.
Laurent Alonso, Philippe Chassaing, Florent Gillet, Svante Janson, Edward M. Reingold, René Schott
2004 J jnl
The worst-case chip problem.
Inf. Process. Lett.
Laurent Alonso, Philippe Chassaing, Edward M. Reingold, René Schott
2002 — book
Calendrical Tabulations - 1900 - 2200.
Edward M. Reingold, Nachum Dershowitz
2002 — book
Calendrical calcuations - the millenium edition.
Edward M. Reingold, Nachum Dershowitz
2002 J jnl
Index assignment for multichannel communication under failure.
IEEE Trans. Inf. Theory
Tanya Y. Berger-Wolf, Edward M. Reingold
2000 J jnl
A potential-based amortized analysis of the union-find data structure.
SIGACT News
Gregory C. Harfst, Edward M. Reingold
2000 J jnl
Index Assignment for Multichannel Communication under Failure
CoRR
Tanya Y. Berger-Wolf, Edward M. Reingold
1999 — ch.
Algorithm Design and Analysis Techniques.
Algorithms and Theory of Computation Handbook
Edward M. Reingold
1999 A* conf
Optimal Multichannel Communication Under Failure.
SODA
Tanya Y. Berger-Wolf, Edward M. Reingold
1997 — ch.
Basic Techniques for Design and Analysis of Algorithms.
The Computer Science and Engineering Handbook
Edward M. Reingold
1997 J jnl
K-M-P String Matching Revisited.
Inf. Process. Lett.
Edward M. Reingold, Kenneth J. Urban, David Gries
1997 J jnl
The Average-Case Complexity of Determining the Majority.
SIAM J. Comput.
Laurent Alonso, Edward M. Reingold, René Schott
1996 J jnl
Basic Techniques for Design and Analysis of Algorithms.
ACM Comput. Surv.
Edward M. Reingold
1996 J jnl
Generalized Kraft's Inequality and Discrete
SIAM J. Comput.
Anmol Mathur, Edward M. Reingold
1995 J jnl
Multidimensional Divide-and-Conquer Maximin Recurrences.
SIAM J. Discret. Math.
Laurent Alonso, Edward M. Reingold, René Schott
1995 J jnl
The Complexity of Pursuit on a Graph.
Theor. Comput. Sci.
Arthur S. Goldstein, Edward M. Reingold
1994 J jnl
Efficient Management of Dynamic Tables.
Inf. Process. Lett.
Aviezri S. Fraenkel, Edward M. Reingold, Prashant Saxena
1993 J jnl
A Fibonacci Version of Kraft's Inequality Applied to Discrete Unimodal Search.
SIAM J. Comput.
Arthur S. Goldstein, Edward M. Reingold
1993 J jnl
Calendrical Calculations, II: Three Historical Calendars.
Softw. Pract. Exp.
Edward M. Reingold, Nachum Dershowitz, Stewart M. Clamen
1993 J jnl
Determining the Majority.
Inf. Process. Lett.
Laurent Alonso, Edward M. Reingold, René Schott
1992 J jnl
"Lion and Man": Upper and Lower Bounds.
INFORMS J. Comput.
Laurent Alonso, Arthur S. Goldstein, Edward M. Reingold
1992 Misc conf
Ordinal Arithmetic with List Structures.
LFCS
Nachum Dershowitz, Edward M. Reingold
1991 J jnl
Graph Drawing by Force-directed Placement.
Softw. Pract. Exp.
Thomas M. J. Fruchterman, Edward M. Reingold
1991 J jnl
More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case.
SIAM J. Comput.
Edward M. Reingold, Xiaojun Shen
1991 J jnl
More Nearly Optimal Algorithms for Unbounded Searching, Part II: The Transfinite Case.
SIAM J. Comput.
Edward M. Reingold, Xiaojun Shen
1991 J jnl
Probabilistic Analysis of a Grouping Algorithm.
Algorithmica
D. F. Wong, Edward M. Reingold
1991 J jnl
Scheduling on a Hypercube.
Inf. Process. Lett.
Xiaojun Shen, Edward M. Reingold
1991 J jnl
Stochastic Rearrangement Rules for Self-Organizing Data Structures.
Algorithmica
Sanjiv Kapoor, Edward M. Reingold
1990 J jnl
Calendrical Calculations.
Softw. Pract. Exp.
Nachum Dershowitz, Edward M. Reingold
1989 J jnl
Optimum lopsided binary trees.
J. ACM
Sanjiv Kapoor, Edward M. Reingold
1989 J jnl
Solution of a Divide-and-Conquer Maximin Recurrence.
SIAM J. Comput.
Zhiyuan Li, Edward M. Reingold
1984 J jnl
A Hierarchy-Driven Amalgamation of Standard and Macro Cells.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Edward M. Reingold, Kenneth J. Supowit
1983 J jnl
Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching.
SIAM J. Comput.
Kenneth J. Supowit, Edward M. Reingold
1983 J jnl
Probabilistic analysis of divide-and-conquer heuristics for minimum weighted euclidean matching.
Networks
Edward M. Reingold, Kenneth J. Supowit
1983 J jnl
The Travelling Salesman Problem and Minimum Matching in the Unit Square.
SIAM J. Comput.
Kenneth J. Supowit, Edward M. Reingold, David A. Plaisted
1982 J jnl
Aspects of insertion in random trees.
Computing
A. Bagchi, Edward M. Reingold
1982 J jnl
The Complexity of Drawing Trees Nicely.
Acta Informatica
Kenneth J. Supowit, Edward M. Reingold
1981 J jnl
A Comment on the Evaluation of Polish Postfix Expressions.
Comput. J.
Edward M. Reingold
1981 J jnl
On a Greedy Heuristic for Complete Matching.
SIAM J. Comput.
Edward M. Reingold, Robert Endre Tarjan
1981 J jnl
Tidier Drawings of Trees.
IEEE Trans. Software Eng.
Edward M. Reingold, John S. Tilford
1980 A* conf
Heuristics for Weighted Perfect Matching
STOC
Kenneth J. Supowit, David A. Plaisted, Edward M. Reingold
1977 J jnl
Understanding the Complexity of Interpolation Search.
Inf. Process. Lett.
Yehoshua Perl, Edward M. Reingold
1976 J jnl
Efficient Generation of the Binary Reflected Gray Code and Its Applications.
Commun. ACM
James R. Bitner, Gideon Ehrlich, Edward M. Reingold
1975 J jnl
Backtrack Programming Techniques.
Commun. ACM
James R. Bitner, Edward M. Reingold
1973 J jnl
A Nonrecursive List Moving Algorithm.
Commun. ACM
Edward M. Reingold
1973 A conf
Automating introductory computer science courses.
SIGCSE
Jürg Nievergelt, Edward M. Reingold
1973 J jnl
Binary Search Trees of Bounded Balance.
SIAM J. Comput.
Jürg Nievergelt, Edward M. Reingold
1972 A* conf
Binary Search Trees of Bounded Balance
STOC
Jürg Nievergelt, Edward M. Reingold
1972 — conf
Establishing lower bounds on algorithms: a survey.
AFIPS Spring Joint Computing Conference
Edward M. Reingold
1972 J jnl
Infix to Prefix Translation: The Insufficiency of a Pushdown Stack.
SIAM J. Comput.
Edward M. Reingold
1972 J jnl
On the Optimality of Some Set Algorithms.
J. ACM
Edward M. Reingold
1972 J jnl
On the Time Required to Detect Cycles and Connectivity in Graphs.
Math. Syst. Theory
Richard C. Holt, Edward M. Reingold
1972 — conf
Simple Proofs of Lower Bounds for Polynomial Evaluation.
Complexity of Computer Computations
Edward M. Reingold, A. Ian Stocks
1971 — conf
Computing the Maximum and the Median
SWAT
Edward M. Reingold
1971 — —
On Some Optimal Algorithms.
Edward M. Reingold
1970 — conf
On the Optimality of Some Set and Vector Algorithms
SWAT
Edward M. Reingold