Edward M. Reingold

Proceedings of the Language, Culture, Computation. Computing - Theory and Technology, 2014

Basic Techniques for Design and Analysis of Algorithms.

[BibT_eX]

Proceedings of the Computing Handbook, 2014

2013

Analysis of Boyer and Moore's MJRTY algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

2012

Modulo intervals: a proposed notation.

[BibT_eX]

[DOI]

SIGACT News, 2012

2011

Improved bounds for cops-and-robber pursuit.

[BibT_eX]

[DOI]

Comput. Geom., 2011

2010

Bounds for cops and robber pursuit.

[BibT_eX]

[DOI]

Comput. Geom., 2010

2009

Average-case analysis of some plurality algorithms.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2009

2008

Average-case lower bounds for the plurality problem.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Determining plurality.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Calendrical calculations (3. ed.).

[BibT_eX]

Cambridge University Press, ISBN: 978-0-521-88540-9, 2008

2004

The worst-case chip problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

Line drawing, leap years, and Euclid.

[BibT_eX]

[DOI]

Mitchell A. Harris

ACM Comput. Surv., 2004

Quicksort with Unreliable Comparisons: A Probabilistic Analysis.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2004

2002

Index assignment for multichannel communication under failure.

[BibT_eX]

[DOI]

Tanya Y. Berger-Wolf

IEEE Trans. Inf. Theory, 2002

Calendrical Tabulations - 1900 - 2200.

[BibT_eX]

[DOI]

Cambridge University Press, ISBN: 978-0-521-78253-1, 2002

Calendrical calcuations - the millenium edition.

[BibT_eX]

Cambridge University Press, ISBN: 978-0-521-77752-0, 2002

2000

A potential-based amortized analysis of the union-find data structure.

[BibT_eX]

[DOI]

Gregory C. Harfst

SIGACT News, 2000

1999

Optimal Multichannel Communication Under Failure.

[BibT_eX]

[DOI]

Tanya Y. Berger-Wolf

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Algorithm Design and Analysis Techniques.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1997

The Average-Case Complexity of Determining the Majority.

[BibT_eX]

[DOI]

René Schott

SIAM J. Comput., 1997

K-M-P String Matching Revisited.

[BibT_eX]

[DOI]

Kenneth J. Urban

David Gries

Inf. Process. Lett., 1997

Basic Techniques for Design and Analysis of Algorithms.

[BibT_eX]

Proceedings of the Computer Science and Engineering Handbook, 1997

1996

Generalized Kraft's Inequality and Discrete <i>k</i>-Modal Search.

[BibT_eX]

[DOI]

Anmol Mathur

SIAM J. Comput., 1996

Basic Techniques for Design and Analysis of Algorithms.

[BibT_eX]

[DOI]

ACM Comput. Surv., 1996

1995

The Complexity of Pursuit on a Graph.

[BibT_eX]

[DOI]

Arthur S. Goldstein

Theor. Comput. Sci., 1995

Multidimensional Divide-and-Conquer Maximin Recurrences.

[BibT_eX]

[DOI]

René Schott

SIAM J. Discret. Math., 1995

1994

Efficient Management of Dynamic Tables.

[BibT_eX]

[DOI]

Aviezri S. Fraenkel

Prashant Saxena

Inf. Process. Lett., 1994

1993

Calendrical Calculations, II: Three Historical Calendars.

[BibT_eX]

[DOI]

Stewart M. Clamen

Softw. Pract. Exp., 1993

A Fibonacci Version of Kraft's Inequality Applied to Discrete Unimodal Search.

[BibT_eX]

[DOI]

Arthur S. Goldstein

SIAM J. Comput., 1993

Determining the Majority.

[BibT_eX]

[DOI]

René Schott

Inf. Process. Lett., 1993

1992

"Lion and Man": Upper and Lower Bounds.

[BibT_eX]

[DOI]

Arthur S. Goldstein

INFORMS J. Comput., 1992

Ordinal Arithmetic with List Structures.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, 1992

1991

Graph Drawing by Force-directed Placement.

[BibT_eX]

[DOI]

Thomas M. J. Fruchterman

Softw. Pract. Exp., 1991

More Nearly Optimal Algorithms for Unbounded Searching, Part II: The Transfinite Case.

[BibT_eX]

[DOI]

Xiaojun Shen

SIAM J. Comput., 1991

More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case.

[BibT_eX]

[DOI]

Xiaojun Shen

SIAM J. Comput., 1991

Scheduling on a Hypercube.

[BibT_eX]

[DOI]

Xiaojun Shen

Inf. Process. Lett., 1991

Probabilistic Analysis of a Grouping Algorithm.

[BibT_eX]

[DOI]

D. F. Wong

Algorithmica, 1991

Stochastic Rearrangement Rules for Self-Organizing Data Structures.

[BibT_eX]

[DOI]

Sanjiv Kapoor

Algorithmica, 1991

1990

Calendrical Calculations.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 1990

1989

Solution of a Divide-and-Conquer Maximin Recurrence.

[BibT_eX]

[DOI]

Zhiyuan Li

SIAM J. Comput., 1989

Optimum lopsided binary trees.

[BibT_eX]

[DOI]

Sanjiv Kapoor

J. ACM, 1989

1984

A Hierarchy-Driven Amalgamation of Standard and Macro Cells.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1984

1983

The Travelling Salesman Problem and Minimum Matching in the Unit Square.

[BibT_eX]

[DOI]

David A. Plaisted

SIAM J. Comput., 1983

Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching.

[BibT_eX]

[DOI]

SIAM J. Comput., 1983

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

[BibT_eX]

[DOI]

Networks, 1983

1982

Aspects of insertion in random trees.

[BibT_eX]

[DOI]

A. Bagchi

Computing, 1982

The Complexity of Drawing Trees Nicely.

[BibT_eX]

[DOI]

Acta Informatica, 1982

1981

Tidier Drawings of Trees.

[BibT_eX]

[DOI]

John S. Tilford

IEEE Trans. Software Eng., 1981

On a Greedy Heuristic for Complete Matching.

[BibT_eX]

[DOI]

Robert Endre Tarjan

SIAM J. Comput., 1981

A Comment on the Evaluation of Polish Postfix Expressions.

[BibT_eX]

[DOI]

Comput. J., 1981

1980

Heuristics for Weighted Perfect Matching

[BibT_eX]

[DOI]

David A. Plaisted

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1977

Understanding the Complexity of Interpolation Search.

[BibT_eX]

[DOI]

Yehoshua Perl

Inf. Process. Lett., 1977

1976

Efficient Generation of the Binary Reflected Gray Code and Its Applications.

[BibT_eX]

[DOI]

James R. Bitner

Gideon Ehrlich

Commun. ACM, 1976

1975

Backtrack Programming Techniques.

[BibT_eX]

[DOI]

James R. Bitner

Commun. ACM, 1975

1973

A Nonrecursive List Moving Algorithm.

[BibT_eX]

[DOI]

Commun. ACM, 1973

Automating introductory computer science courses.

[BibT_eX]

[DOI]

Jürg Nievergelt

Proceedings of the 3rd SIGCSE Technical Symposium on Computer Science Education, 1973

1972

Infix to Prefix Translation: The Insufficiency of a Pushdown Stack.

[BibT_eX]

[DOI]

SIAM J. Comput., 1972

On the Time Required to Detect Cycles and Connectivity in Graphs.

[BibT_eX]

[DOI]

Richard C. Holt

Math. Syst. Theory, 1972

On the Optimality of Some Set Algorithms.

[BibT_eX]

[DOI]

J. ACM, 1972

Binary Search Trees of Bounded Balance

[BibT_eX]

[DOI]

Jürg Nievergelt

Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

Simple Proofs of Lower Bounds for Polynomial Evaluation.

[BibT_eX]

[DOI]

A. Ian Stocks

Proceedings of a symposium on the Complexity of Computer Computations, 1972

Establishing lower bounds on algorithms: a survey.

[BibT_eX]

[DOI]

Proceedings of the American Federation of Information Processing Societies: AFIPS Conference Proceedings: 1972 Spring Joint Computer Conference, 1972

1971

On Some Optimal Algorithms.

[BibT_eX]

PhD thesis, 1971

Computing the Maximum and the Median

[BibT_eX]

[DOI]

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

1970

On the Optimality of Some Set and Vector Algorithms

[BibT_eX]

[DOI]