The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

John E. Hopcroft: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Steven Fortune, John E. Hopcroft, James Wyllie
    The Directed Subgraph Homeomorphism Problem. [Citation Graph (7, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:10, n:, pp:111-121 [Journal]
  2. John E. Hopcroft, Richard M. Karp
    An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs. [Citation Graph (5, 0)][DBLP]
    SIAM J. Comput., 1973, v:2, n:4, pp:225-231 [Journal]
  3. John E. Hopcroft, J. K. Wong
    Linear Time Algorithm for Isomorphism of Planar Graphs (Preliminary Report) [Citation Graph (2, 0)][DBLP]
    STOC, 1974, pp:172-184 [Conf]
  4. John E. Hopcroft, Robert Endre Tarjan
    Efficient Planarity Testing. [Citation Graph (2, 0)][DBLP]
    J. ACM, 1974, v:21, n:4, pp:549-568 [Journal]
  5. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman
    On Finding Lowest Common Ancestors in Trees [Citation Graph (1, 0)][DBLP]
    STOC, 1973, pp:253-265 [Conf]
  6. John E. Hopcroft, Robert Endre Tarjan
    Efficient Algorithms for Graph Manipulation [H] (Algorithm 447). [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1973, v:16, n:6, pp:372-378 [Journal]
  7. Christoph M. Hoffmann, John E. Hopcroft, Michael S. Karasick
    Towards Implementing Robust Geometric Computations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:106-117 [Conf]
  8. Anirban Dasgupta, John E. Hopcroft, Ravi Kannan, Pradipta Prometheus Mitra
    Spectral Clustering by Recursive Partitioning. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:256-267 [Conf]
  9. Allan Borodin, Robert L. Constable, John E. Hopcroft
    Dense and Non-Dense Families of Complexity Classes [Citation Graph (0, 0)][DBLP]
    FOCS, 1969, pp:7-19 [Conf]
  10. Allan Borodin, Joachim von zur Gathen, John E. Hopcroft
    Fast Parallel Matrix and GCD Computations [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:65-71 [Conf]
  11. Anirban Dasgupta, John E. Hopcroft, Jon M. Kleinberg, Mark Sandler
    On Learning Mixtures of Heavy-Tailed Distributions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:491-500 [Conf]
  12. Anirban Dasgupta, John E. Hopcroft, Frank McSherry
    Spectral Analysis of Random Graphs with Skewed Degree Distributions. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:602-610 [Conf]
  13. Merrick L. Furst, John E. Hopcroft, Eugene M. Luks
    Polynomial-Time Algorithms for Permutation Groups [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:36-41 [Conf]
  14. Seymour Ginsburg, John E. Hopcroft
    Two-Way Balloon Automata and AFL [Citation Graph (0, 0)][DBLP]
    FOCS, 1968, pp:292-297 [Conf]
  15. Juris Hartmanis, John E. Hopcroft
    Structure of Undecidable Problems in Automata Theory [Citation Graph (0, 0)][DBLP]
    FOCS, 1968, pp:327-333 [Conf]
  16. John E. Hopcroft, Deborah Joseph, Sue Whitesides
    On the Movement of Robot Arms in 2-Dimensional Bounded Regions [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:280-289 [Conf]
  17. John E. Hopcroft, L. R. Kerr
    Some Techniques for Proving Certain Simple Programs Optimal [Citation Graph (0, 0)][DBLP]
    FOCS, 1969, pp:36-45 [Conf]
  18. John E. Hopcroft, Richard M. Karp
    A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1971, pp:122-125 [Conf]
  19. John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant
    On Time versus Space and Related Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:57-64 [Conf]
  20. John E. Hopcroft, Jeffrey D. Ullman
    Two Results on One-Way Stack Automata [Citation Graph (0, 0)][DBLP]
    FOCS, 1967, pp:37-44 [Conf]
  21. John E. Hopcroft, Jeffrey D. Ullman
    An Approach to a Unified Theory of Automata [Citation Graph (0, 0)][DBLP]
    FOCS, 1967, pp:140-147 [Conf]
  22. A. J. Korenjak, John E. Hopcroft
    Simple Deterministic Languages [Citation Graph (0, 0)][DBLP]
    FOCS, 1966, pp:36-46 [Conf]
  23. Peter Weiner, John E. Hopcroft
    Modular Decomposition of Synchronous Sequential Machines [Citation Graph (0, 0)][DBLP]
    FOCS, 1967, pp:233-239 [Conf]
  24. John E. Hopcroft
    Automata Theory: Its Past and Future. [Citation Graph (0, 0)][DBLP]
    A Half-Century of Automata Theory, 2000, pp:37-47 [Conf]
  25. Steven Fortune, John E. Hopcroft, Erik Meineche Schmidt
    The Complexity of Equivalence and Containment for Free Single Variable Program Schemes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1978, pp:227-240 [Conf]
  26. Thorsten Joachims, John E. Hopcroft
    Error bounds for correlation clustering. [Citation Graph (0, 0)][DBLP]
    ICML, 2005, pp:385-392 [Conf]
  27. Sheila A. Greibach, John E. Hopcroft
    Scattered context grammars. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1968, pp:260-264 [Conf]
  28. John E. Hopcroft
    Complexity of Computer Computations. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1974, pp:620-626 [Conf]
  29. John E. Hopcroft, Robert Endre Tarjan
    Planarity Testing in V log V Steps: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1971, pp:85-90 [Conf]
  30. John E. Hopcroft, Omar Khan, Brian Kulis, Bart Selman
    Natural communities in large linked networks. [Citation Graph (0, 0)][DBLP]
    KDD, 2003, pp:541-546 [Conf]
  31. John E. Hopcroft
    The Promise of Electronic Prototyping. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:128-139 [Conf]
  32. André Allavena, Alan J. Demers, John E. Hopcroft
    Correctness of a gossip based membership protocol. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:292-301 [Conf]
  33. Allan Borodin, John E. Hopcroft
    Routing, Merging and Sorting on Parallel Models of Computation (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:338-344 [Conf]
  34. John E. Hopcroft, J. Musinski
    Duality Applied to the Complexity of Matrix Multiplications and other Bilinear Forms [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:73-87 [Conf]
  35. John E. Hopcroft
    Recent Directions in Algorithmic Research. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:123-134 [Conf]
  36. Christoph M. Hoffmann, John E. Hopcroft
    The Geometry of Projective Blending Surfaces. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1988, v:37, n:1-3, pp:357-376 [Journal]
  37. John E. Hopcroft, Peter J. Kahn
    A Paradigm for Robust Geometric Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:7, n:4, pp:339-380 [Journal]
  38. John E. Hopcroft
    The Impact of Robotics on Computer Science. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1986, v:29, n:6, pp:486-498 [Journal]
  39. John E. Hopcroft
    Computer Science: The Emergence of a Discipline. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1987, v:30, n:3, pp:198-202 [Journal]
  40. Chandrajit L. Bajaj, Christoph M. Hoffmann, Robert E. Lynch, John E. Hopcroft
    Tracing surface intersections. [Citation Graph (0, 0)][DBLP]
    Computer Aided Geometric Design, 1988, v:5, n:4, pp:285-307 [Journal]
  41. John E. Hopcroft
    Electronic Prototyping. [Citation Graph (0, 0)][DBLP]
    IEEE Computer, 1989, v:22, n:3, pp:55-57 [Journal]
  42. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman
    Time and Tape Complexity of Pushdown Automaton Languages [Citation Graph (0, 0)][DBLP]
    Information and Control, 1968, v:13, n:3, pp:186-206 [Journal]
  43. Allan Borodin, Joachim von zur Gathen, John E. Hopcroft
    Fast Parallel Matrix and GCD Computations [Citation Graph (0, 0)][DBLP]
    Information and Control, 1982, v:52, n:3, pp:241-256 [Journal]
  44. John E. Hopcroft, Jeffrey D. Ullman
    Sets Accepted by One-Way Stack Automata Are Context Sensitive [Citation Graph (0, 0)][DBLP]
    Information and Control, 1968, v:13, n:2, pp:114-133 [Journal]
  45. Steven Fortune, John E. Hopcroft
    A Note on Rabin's Nearest-Neighbor Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:1, pp:20-23 [Journal]
  46. John E. Hopcroft, Robert Endre Tarjan
    A V² Algorithm for Determining Isomorphism of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1971, v:1, n:1, pp:32-34 [Journal]
  47. Seymour Ginsburg, John E. Hopcroft
    Two-way balloon automata and AFL. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1970, v:17, n:1, pp:3-13 [Journal]
  48. Juris Hartmanis, John E. Hopcroft
    An Overview of the Theory of Computational Complexity. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1971, v:18, n:2, pp:444-475 [Journal]
  49. John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant
    On Time Versus Space. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1977, v:24, n:2, pp:332-337 [Journal]
  50. John E. Hopcroft, Jeffrey D. Ullman
    Decidable and Undecidable Questions About Automata. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1968, v:15, n:2, pp:317-324 [Journal]
  51. John E. Hopcroft, Jeffrey D. Ullman
    Relations Between Time and Tape Complexities. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1968, v:15, n:3, pp:414-427 [Journal]
  52. John E. Hopcroft, Jeffrey D. Ullman
    Some Results on Tape-Bounded Turing Machines. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1969, v:16, n:1, pp:168-177 [Journal]
  53. Alfred V. Aho, Jeffrey D. Ullman, John E. Hopcroft
    On the Computational Power of Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1970, v:4, n:2, pp:129-136 [Journal]
  54. Allan Borodin, John E. Hopcroft
    Routing, Merging, and Sorting on Parallel Models of Computation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:30, n:1, pp:130-145 [Journal]
  55. Sheila A. Greibach, John E. Hopcroft
    Scattered Context Grammars. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1969, v:3, n:3, pp:233-247 [Journal]
  56. Juris Hartmanis, John E. Hopcroft
    What makes Some Language Theory Problems Undecidable. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1970, v:4, n:4, pp:368-376 [Journal]
  57. John E. Hopcroft, Robert Endre Tarjan
    A V log V Algorithm for Isomorphism of Triconnected Planar Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1973, v:7, n:3, pp:323-331 [Journal]
  58. John E. Hopcroft, Jeffrey D. Ullman
    Nonerasing Stack Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1967, v:1, n:2, pp:166-186 [Journal]
  59. John E. Hopcroft, Jeffrey D. Ullman
    Deterministic Stack Automata and the Quotient Operator. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1968, v:2, n:1, pp:1-12 [Journal]
  60. Allan Borodin, Ronald Fagin, John E. Hopcroft, Martin Tompa
    Decreasing the Nesting Depth of Expressions Involving Square Roots. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1985, v:1, n:2, pp:169-188 [Journal]
  61. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman
    A General Theory of Translation. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1969, v:3, n:3, pp:193-221 [Journal]
  62. Seymour Ginsburg, John E. Hopcroft
    Images of AFL under Certain Families of Homomorphisms. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1971, v:5, n:3, pp:216-227 [Journal]
  63. John E. Hopcroft
    On the Equivalence and Containment Problems for Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1969, v:3, n:2, pp:119-124 [Journal]
  64. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman
    On Finding Lowest Common Ancestors in Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1976, v:5, n:1, pp:115-132 [Journal]
  65. Richard Cole, John E. Hopcroft
    On Edge Coloring Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:540-546 [Journal]
  66. John E. Hopcroft, Deborah Joseph, Sue Whitesides
    Movement Problems for 2-Dimensional Linkages. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:3, pp:610-629 [Journal]
  67. John E. Hopcroft, Deborah Joseph, Sue Whitesides
    On the Movement of Robot Arms in 2-Dimensional Bounded Regions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:2, pp:315-333 [Journal]
  68. John E. Hopcroft, J. Musinski
    Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1973, v:2, n:3, pp:159-173 [Journal]
  69. John E. Hopcroft, Robert Endre Tarjan
    Dividing a Graph into Triconnected Components. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1973, v:2, n:3, pp:135-158 [Journal]
  70. John E. Hopcroft, Jeffrey D. Ullman
    Set Merging Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1973, v:2, n:4, pp:294-303 [Journal]
  71. John E. Hopcroft, Gordon T. Wilfong
    Reducing Multiple Object Motion Planning to Graph Searching. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:3, pp:768-785 [Journal]
  72. John E. Hopcroft, Jean-Jacques Pansiot
    On the Reachability Problem for 5-Dimensional Vector Addition Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:135-159 [Journal]
  73. Christoph M. Hoffmann, John E. Hopcroft
    Automatic surface generation in computer aided design. [Citation Graph (0, 0)][DBLP]
    The Visual Computer, 1985, v:1, n:2, pp:92-100 [Journal]
  74. Anirban Dasgupta, John E. Hopcroft, Ravi Kannan, Pradipta Prometheus Mitra
    Spectral clustering with limited independence. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1036-1045 [Conf]
  75. Reid Andersen, Christian Borgs, Jennifer T. Chayes, John Hopcraft, Vahab S. Mirrokni, Shang-Hua Teng
    Local Computation of PageRank Contributions. [Citation Graph (0, 0)][DBLP]
    WAW, 2007, pp:150-165 [Conf]
  76. John E. Hopcroft, Daniel Sheldon
    Manipulation-Resistant Reputations Using Hitting Time. [Citation Graph (0, 0)][DBLP]
    WAW, 2007, pp:68-81 [Conf]

  77. On the Stability of Web Crawling and Web Search. [Citation Graph (, )][DBLP]


  78. New Research Directions in the Information Age. [Citation Graph (, )][DBLP]


  79. Recovering Social Networks from Contagion Information. [Citation Graph (, )][DBLP]


  80. Community Structure in Large Complex Networks. [Citation Graph (, )][DBLP]


  81. Computer Science in the Information Age. [Citation Graph (, )][DBLP]


  82. Robust PageRank and locally computable spam detection features. [Citation Graph (, )][DBLP]


Search in 0.022secs, Finished in 0.026secs
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