The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Edward M. Reingold: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jürg Nievergelt, Edward M. Reingold
    Binary Search Trees of Bounded Balance. [Citation Graph (4, 0)][DBLP]
    SIAM J. Comput., 1973, v:2, n:1, pp:33-43 [Journal]
  2. Edward M. Reingold, John S. Tilford
    Tidier Drawings of Trees. [Citation Graph (3, 0)][DBLP]
    IEEE Trans. Software Eng., 1981, v:7, n:2, pp:223-228 [Journal]
  3. James R. Bitner, Edward M. Reingold
    Backtrack Programming Techniques. [Citation Graph (2, 0)][DBLP]
    Commun. ACM, 1975, v:18, n:11, pp:651-656 [Journal]
  4. Edward M. Reingold
    On the Optimality of Some Set Algorithms. [Citation Graph (2, 0)][DBLP]
    J. ACM, 1972, v:19, n:4, pp:649-659 [Journal]
  5. Kenneth J. Supowit, Edward M. Reingold
    The Complexity of Drawing Trees Nicely. [Citation Graph (1, 0)][DBLP]
    Acta Inf., 1982, v:18, n:, pp:377-392 [Journal]
  6. Yehoshua Perl, Edward M. Reingold
    Understanding the Complexity of Interpolation Search. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1977, v:6, n:6, pp:219-222 [Journal]
  7. Edward M. Reingold
    On the Optimality of Some Set and Vector Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 1970, pp:68-71 [Conf]
  8. Edward M. Reingold
    Computing the Maximum and the Median [Citation Graph (0, 0)][DBLP]
    FOCS, 1971, pp:216-218 [Conf]
  9. Nachum Dershowitz, Edward M. Reingold
    Ordinal Arithmetic with List Structures. [Citation Graph (0, 0)][DBLP]
    LFCS, 1992, pp:117-126 [Conf]
  10. Tanya Y. Berger-Wolf, Edward M. Reingold
    Optimal Multichannel Communication Under Failure. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:858-859 [Conf]
  11. Jürg Nievergelt, Edward M. Reingold
    Binary Search Trees of Bounded Balance [Citation Graph (0, 0)][DBLP]
    STOC, 1972, pp:137-142 [Conf]
  12. Kenneth J. Supowit, David A. Plaisted, Edward M. Reingold
    Heuristics for Weighted Perfect Matching [Citation Graph (0, 0)][DBLP]
    STOC, 1980, pp:398-419 [Conf]
  13. Sanjiv Kapoor, Edward M. Reingold
    Stochastic Rearrangement Rules for Self-Organizing Data Structures. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:2, pp:278-291 [Journal]
  14. D. F. Wong, Edward M. Reingold
    Probabilistic Analysis of a Grouping Algorithm. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:2, pp:192-206 [Journal]
  15. James R. Bitner, Gideon Ehrlich, Edward M. Reingold
    Efficient Generation of the Binary Reflected Gray Code and Its Applications. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1976, v:19, n:9, pp:517-521 [Journal]
  16. Edward M. Reingold
    A Nonrecursive List Moving Algorithm. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1973, v:16, n:5, pp:305-307 [Journal]
  17. Edward M. Reingold
    A Comment on the Evaluation of Polish Postfix Expressions. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1981, v:24, n:3, pp:288- [Journal]
  18. Tanya Y. Berger-Wolf, Edward M. Reingold
    Index Assignment for Multichannel Communication under Failure [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  19. Laurent Alonso, Philippe Chassaing, Florent Gillet, Svante Janson, Edward M. Reingold, René Schott
    Quicksort with Unreliable Comparisons: A Probabilistic Analysis. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:4-5, pp:419-449 [Journal]
  20. Mitchell A. Harris, Edward M. Reingold
    Line drawing, leap years, and Euclid. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 2004, v:36, n:1, pp:68-80 [Journal]
  21. Edward M. Reingold
    Basic Techniques for Design and Analysis of Algorithms. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:1, pp:19-21 [Journal]
  22. Laurent Alonso, Philippe Chassaing, Edward M. Reingold, René Schott
    The worst-case chip problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:6, pp:303-308 [Journal]
  23. Laurent Alonso, Edward M. Reingold, René Schott
    Determining the Majority. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:5, pp:253-255 [Journal]
  24. Aviezri S. Fraenkel, Edward M. Reingold, Prashant Saxena
    Efficient Management of Dynamic Tables. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:1, pp:25-30 [Journal]
  25. Edward M. Reingold, Kenneth J. Urban, David Gries
    K-M-P String Matching Revisited. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:5, pp:217-223 [Journal]
  26. Xiaojun Shen, Edward M. Reingold
    Scheduling on a Hypercube. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:40, n:6, pp:323-328 [Journal]
  27. Sanjiv Kapoor, Edward M. Reingold
    Optimum lopsided binary trees. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:3, pp:573-590 [Journal]
  28. Richard C. Holt, Edward M. Reingold
    On the Time Required to Detect Cycles and Connectivity in Graphs. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1972, v:6, n:2, pp:103-106 [Journal]
  29. Laurent Alonso, Edward M. Reingold, René Schott
    The Average-Case Complexity of Determining the Majority. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:1, pp:1-14 [Journal]
  30. Arthur S. Goldstein, Edward M. Reingold
    A Fibonacci Version of Kraft's Inequality Applied to Discrete Unimodal Search. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:4, pp:751-777 [Journal]
  31. Zhiyuan Li, Edward M. Reingold
    Solution of a Divide-and-Conquer Maximin Recurrence. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:6, pp:1188-1200 [Journal]
  32. Anmol Mathur, Edward M. Reingold
    Generalized Kraft's Inequality and Discrete k-Modal Search. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:2, pp:420-447 [Journal]
  33. Edward M. Reingold
    Infix to Prefix Translation: The Insufficiency of a Pushdown Stack. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1972, v:1, n:4, pp:350-353 [Journal]
  34. Edward M. Reingold, Xiaojun Shen
    More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:1, pp:156-183 [Journal]
  35. Edward M. Reingold, Xiaojun Shen
    More Nearly Optimal Algorithms for Unbounded Searching, Part II: The Transfinite Case. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:1, pp:184-208 [Journal]
  36. Edward M. Reingold, Robert Endre Tarjan
    On a Greedy Heuristic for Complete Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:4, pp:676-681 [Journal]
  37. Kenneth J. Supowit, Edward M. Reingold
    Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:1, pp:118-143 [Journal]
  38. Kenneth J. Supowit, Edward M. Reingold, David A. Plaisted
    The Traveling Salesman Problem and Minimum Matching in the Unit Square. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:1, pp:144-156 [Journal]
  39. Laurent Alonso, Edward M. Reingold, René Schott
    Multidimensional Divide-and-Conquer Maximin Recurrences. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:3, pp:428-447 [Journal]
  40. Nachum Dershowitz, Edward M. Reingold
    Calendrical Calculations. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1990, v:20, n:9, pp:899-928 [Journal]
  41. Thomas M. J. Fruchterman, Edward M. Reingold
    Graph Drawing by Force-directed Placement. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1991, v:21, n:11, pp:1129-1164 [Journal]
  42. Edward M. Reingold, Nachum Dershowitz, Stewart M. Clamen
    Calendrical Calculations, II: Three Historical Calendars. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1993, v:23, n:4, pp:383-404 [Journal]
  43. Edward M. Reingold, Kenneth J. Supowit
    A Hierarchy-Driven Amalgamation of Standard and Macro Cells. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1984, v:3, n:1, pp:3-11 [Journal]
  44. Arthur S. Goldstein, Edward M. Reingold
    The Complexity of Pursuit on a Graph. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:143, n:1, pp:93-112 [Journal]
  45. Tanya Y. Berger-Wolf, Edward M. Reingold
    Index assignment for multichannel communication under failure. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:10, pp:2656-2668 [Journal]

  46. Bounds for cops and robber pursuit. [Citation Graph (, )][DBLP]


Search in 0.146secs, Finished in 0.149secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002