default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdward M. Reingold
Person information
- affiliation: University of Illinois, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c10]Edward M. Reingold:
Four Apt Elementary Examples of Recursion. Language, Culture, Computation (1) 2014: 213-224- [p2]Edward M. Reingold:
Basic Techniques for Design and Analysis of Algorithms. Computing Handbook, 3rd ed. (1) 2014: 4: 1-23 - 2013
- [j49]Laurent Alonso, Edward M. Reingold:
Analysis of Boyer and Moore's MJRTY algorithm. Inf. Process. Lett. 113(13): 495-497 (2013) - 2012
- [j48]Nachum Dershowitz, Edward M. Reingold:
Modulo intervals: a proposed notation. SIGACT News 43(3): 60-64 (2012) - 2011
- [j47]Laurent Alonso, Edward M. Reingold:
Improved bounds for cops-and-robber pursuit. Comput. Geom. 44(8): 365-369 (2011) - 2010
- [j46]Laurent Alonso, Edward M. Reingold:
Bounds for cops and robber pursuit. Comput. Geom. 43(9): 749-766 (2010)
2000 – 2009
- 2009
- [j45]Laurent Alonso, Edward M. Reingold:
Average-case analysis of some plurality algorithms. ACM Trans. Algorithms 5(2): 17:1-17:36 (2009) - 2008
- [b4]Nachum Dershowitz, Edward M. Reingold:
Calendrical calculations (3. ed.). Cambridge University Press 2008, ISBN 978-0-521-88540-9, pp. I-XXIX, 1-479 - [j44]Laurent Alonso, Edward M. Reingold:
Determining plurality. ACM Trans. Algorithms 4(3): 26:1-26:19 (2008) - [j43]Laurent Alonso, Edward M. Reingold:
Average-case lower bounds for the plurality problem. ACM Trans. Algorithms 4(3): 27:1-27:17 (2008) - 2004
- [j42]Laurent Alonso, Philippe Chassaing, Florent Gillet, Svante Janson, Edward M. Reingold, René Schott:
Quicksort with Unreliable Comparisons: A Probabilistic Analysis. Comb. Probab. Comput. 13(4-5): 419-449 (2004) - [j41]Mitchell A. Harris, Edward M. Reingold:
Line drawing, leap years, and Euclid. ACM Comput. Surv. 36(1): 68-80 (2004) - [j40]Laurent Alonso, Philippe Chassaing, Edward M. Reingold, René Schott:
The worst-case chip problem. Inf. Process. Lett. 89(6): 303-308 (2004) - 2002
- [b3]Edward M. Reingold, Nachum Dershowitz:
Calendrical Tabulations - 1900 - 2200. Cambridge University Press 2002, ISBN 978-0-521-78253-1, pp. I-XXX, 1-606 - [b2]Edward M. Reingold, Nachum Dershowitz:
Calendrical calcuations - the millenium edition. Cambridge University Press 2002, ISBN 978-0-521-77752-0, pp. I-XXXII, 1-422 - [j39]Tanya Y. Berger-Wolf, Edward M. Reingold:
Index assignment for multichannel communication under failure. IEEE Trans. Inf. Theory 48(10): 2656-2668 (2002) - 2000
- [j38]Gregory C. Harfst, Edward M. Reingold:
A potential-based amortized analysis of the union-find data structure. SIGACT News 31(3): 86-95 (2000) - [i1]Tanya Y. Berger-Wolf, Edward M. Reingold:
Index Assignment for Multichannel Communication under Failure. CoRR cs.DS/0011045 (2000)
1990 – 1999
- 1999
- [c9]Tanya Y. Berger-Wolf, Edward M. Reingold:
Optimal Multichannel Communication Under Failure. SODA 1999: 858-859 - [p1]Edward M. Reingold:
Algorithm Design and Analysis Techniques. Algorithms and Theory of Computation Handbook 1999 - 1997
- [j37]Edward M. Reingold, Kenneth J. Urban, David Gries:
K-M-P String Matching Revisited. Inf. Process. Lett. 64(5): 217-223 (1997) - [j36]Laurent Alonso, Edward M. Reingold, René Schott:
The Average-Case Complexity of Determining the Majority. SIAM J. Comput. 26(1): 1-14 (1997) - [r1]Edward M. Reingold:
Basic Techniques for Design and Analysis of Algorithms. The Computer Science and Engineering Handbook 1997: 64-85 - 1996
- [j35]Edward M. Reingold:
Basic Techniques for Design and Analysis of Algorithms. ACM Comput. Surv. 28(1): 19-21 (1996) - [j34]Anmol Mathur, Edward M. Reingold:
Generalized Kraft's Inequality and Discrete k-Modal Search. SIAM J. Comput. 25(2): 420-447 (1996) - 1995
- [j33]Laurent Alonso, Edward M. Reingold, René Schott:
Multidimensional Divide-and-Conquer Maximin Recurrences. SIAM J. Discret. Math. 8(3): 428-447 (1995) - [j32]Arthur S. Goldstein, Edward M. Reingold:
The Complexity of Pursuit on a Graph. Theor. Comput. Sci. 143(1): 93-112 (1995) - 1994
- [j31]Aviezri S. Fraenkel, Edward M. Reingold, Prashant Saxena:
Efficient Management of Dynamic Tables. Inf. Process. Lett. 50(1): 25-30 (1994) - 1993
- [j30]Laurent Alonso, Edward M. Reingold, René Schott:
Determining the Majority. Inf. Process. Lett. 47(5): 253-255 (1993) - [j29]Arthur S. Goldstein, Edward M. Reingold:
A Fibonacci Version of Kraft's Inequality Applied to Discrete Unimodal Search. SIAM J. Comput. 22(4): 751-777 (1993) - [j28]Edward M. Reingold, Nachum Dershowitz, Stewart M. Clamen:
Calendrical Calculations, II: Three Historical Calendars. Softw. Pract. Exp. 23(4): 383-404 (1993) - 1992
- [j27]Laurent Alonso, Arthur S. Goldstein, Edward M. Reingold:
"Lion and Man": Upper and Lower Bounds. INFORMS J. Comput. 4(4): 447-452 (1992) - [c8]Nachum Dershowitz, Edward M. Reingold:
Ordinal Arithmetic with List Structures. LFCS 1992: 117-126 - 1991
- [j26]D. F. Wong
, Edward M. Reingold:
Probabilistic Analysis of a Grouping Algorithm. Algorithmica 6(2): 192-206 (1991) - [j25]Sanjiv Kapoor, Edward M. Reingold:
Stochastic Rearrangement Rules for Self-Organizing Data Structures. Algorithmica 6(2): 278-291 (1991) - [j24]Xiaojun Shen, Edward M. Reingold:
Scheduling on a Hypercube. Inf. Process. Lett. 40(6): 323-328 (1991) - [j23]Edward M. Reingold, Xiaojun Shen:
More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case. SIAM J. Comput. 20(1): 156-183 (1991) - [j22]Edward M. Reingold, Xiaojun Shen:
More Nearly Optimal Algorithms for Unbounded Searching, Part II: The Transfinite Case. SIAM J. Comput. 20(1): 184-208 (1991) - [j21]Thomas M. J. Fruchterman, Edward M. Reingold:
Graph Drawing by Force-directed Placement. Softw. Pract. Exp. 21(11): 1129-1164 (1991) - 1990
- [j20]Nachum Dershowitz, Edward M. Reingold:
Calendrical Calculations. Softw. Pract. Exp. 20(9): 899-928 (1990)
1980 – 1989
- 1989
- [j19]Sanjiv Kapoor, Edward M. Reingold:
Optimum lopsided binary trees. J. ACM 36(3): 573-590 (1989) - [j18]Zhiyuan Li, Edward M. Reingold:
Solution of a Divide-and-Conquer Maximin Recurrence. SIAM J. Comput. 18(6): 1188-1200 (1989) - 1984
- [j17]Edward M. Reingold, Kenneth J. Supowit:
A Hierarchy-Driven Amalgamation of Standard and Macro Cells. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 3(1): 3-11 (1984) - 1983
- [j16]Edward M. Reingold, Kenneth J. Supowit:
Probabilistic analysis of divide-and-conquer heuristics for minimum weighted euclidean matching. Networks 13(1): 49-66 (1983) - [j15]Kenneth J. Supowit, Edward M. Reingold:
Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching. SIAM J. Comput. 12(1): 118-143 (1983) - [j14]Kenneth J. Supowit, Edward M. Reingold, David A. Plaisted:
The Travelling Salesman Problem and Minimum Matching in the Unit Square. SIAM J. Comput. 12(1): 144-156 (1983) - 1982
- [j13]Kenneth J. Supowit, Edward M. Reingold:
The Complexity of Drawing Trees Nicely. Acta Informatica 18: 377-392 (1982) - [j12]A. Bagchi, Edward M. Reingold:
Aspects of insertion in random trees. Computing 29(1): 11-29 (1982) - 1981
- [j11]Edward M. Reingold:
A Comment on the Evaluation of Polish Postfix Expressions. Comput. J. 24(3): 288 (1981) - [j10]Edward M. Reingold, Robert Endre Tarjan:
On a Greedy Heuristic for Complete Matching. SIAM J. Comput. 10(4): 676-681 (1981) - [j9]Edward M. Reingold, John S. Tilford:
Tidier Drawings of Trees. IEEE Trans. Software Eng. 7(2): 223-228 (1981) - 1980
- [c7]Kenneth J. Supowit, David A. Plaisted, Edward M. Reingold:
Heuristics for Weighted Perfect Matching. STOC 1980: 398-419
1970 – 1979
- 1977
- [j8]Yehoshua Perl, Edward M. Reingold:
Understanding the Complexity of Interpolation Search. Inf. Process. Lett. 6(6): 219-222 (1977) - 1976
- [j7]James R. Bitner, Gideon Ehrlich, Edward M. Reingold:
Efficient Generation of the Binary Reflected Gray Code and Its Applications. Commun. ACM 19(9): 517-521 (1976) - 1975
- [j6]James R. Bitner, Edward M. Reingold:
Backtrack Programming Techniques. Commun. ACM 18(11): 651-656 (1975) - 1973
- [j5]Edward M. Reingold:
A Nonrecursive List Moving Algorithm. Commun. ACM 16(5): 305-307 (1973) - [j4]Jürg Nievergelt, Edward M. Reingold:
Binary Search Trees of Bounded Balance. SIAM J. Comput. 2(1): 33-43 (1973) - [c6]Jürg Nievergelt, Edward M. Reingold:
Automating introductory computer science courses. SIGCSE 1973: 24-25 - 1972
- [j3]Edward M. Reingold:
On the Optimality of Some Set Algorithms. J. ACM 19(4): 649-659 (1972) - [j2]Richard C. Holt, Edward M. Reingold:
On the Time Required to Detect Cycles and Connectivity in Graphs. Math. Syst. Theory 6(2): 103-106 (1972) - [j1]Edward M. Reingold:
Infix to Prefix Translation: The Insufficiency of a Pushdown Stack. SIAM J. Comput. 1(4): 350-353 (1972) - [c5]Edward M. Reingold:
Establishing lower bounds on algorithms: a survey. AFIPS Spring Joint Computing Conference 1972: 471-481 - [c4]Edward M. Reingold, A. Ian Stocks:
Simple Proofs of Lower Bounds for Polynomial Evaluation. Complexity of Computer Computations 1972: 21-30 - [c3]Jürg Nievergelt, Edward M. Reingold:
Binary Search Trees of Bounded Balance. STOC 1972: 137-142 - 1971
- [b1]Edward M. Reingold:
On Some Optimal Algorithms. Cornell University, USA, 1971 - [c2]Edward M. Reingold:
Computing the Maximum and the Median. SWAT 1971: 216-218 - 1970
- [c1]Edward M. Reingold:
On the Optimality of Some Set and Vector Algorithms. SWAT 1970: 68-71
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
