John E. Hopcroft

According to our database1, John E. Hopcroft authored at least 157 papers between 1965 and 2018.

Collaborative distances:

Awards

Turing Prize recipient

Turing Prize 1986, "For fundamental achievements in the design and analysis of algorithms and data structures" awarded to John Hopcroft and Robert Tarjan.

ACM Fellow

ACM Fellow 1994, "For fundamental achievements in the design and analysis of algorithms and data structures.".

IEEE Fellow

IEEE Fellow 1987, "For contributions to the field of computing.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Local Spectral Clustering for Overlapping Community Detection.
TKDD, 2018

Neighbourhood-preserving dimension reduction via localised multidimensional scaling.
Theor. Comput. Sci., 2018

Hidden community detection in social networks.
Inf. Sci., 2018

Curvature-based Comparison of Two Neural Networks.
CoRR, 2018

2017
Krylov Subspace Approximation for Local Community Detection.
CoRR, 2017

The Local Dimension of Deep Manifold.
CoRR, 2017

Understanding Deep Representations through Random Weights.
CoRR, 2017

Snapshot Ensembles: Train 1, get M for free.
CoRR, 2017

Hidden Community Detection in Social Networks.
CoRR, 2017

Computer Science in the Information Age.
IEEE Intelligent Informatics Bulletin, 2017

Local Lanczos Spectral Approximation for Community Detection.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2017

Learning Latent Topics from the Word Co-occurrence Network.
Proceedings of the Theoretical Computer Science - 35th National Conference, 2017

Deep Compression on Convolutional Neural Network for Artistic Style Transfer.
Proceedings of the Theoretical Computer Science - 35th National Conference, 2017

Stacked Generative Adversarial Networks.
Proceedings of the 2017 IEEE Conference on Computer Vision and Pattern Recognition, 2017

2016
Special Issue for FAW 2014.
J. Comb. Optim., 2016

Stacked Generative Adversarial Networks.
CoRR, 2016

A Powerful Generative Model Using Random Weights for the Deep Image Representation.
CoRR, 2016

The Lifecycle and Cascade of WeChat Social Messaging Groups.
Proceedings of the 25th International Conference on World Wide Web, 2016

In a World That Counts: Clustering and Detecting Fake Social Engagement at Scale.
Proceedings of the 25th International Conference on World Wide Web, 2016

A Powerful Generative Model Using Random Weights for the Deep Image Representation.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Nonlinear Dimension Reduction by Local Multidimensional Scaling.
Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

2015
Use of Local Group Information to Identify Communities in Networks.
TKDD, 2015

Frontiers of Algorithmics.
Theor. Comput. Sci., 2015

The Lifecycle and Cascade of Social Messaging Groups.
CoRR, 2015

Convergent Learning: Do different neural networks learn the same representations?
CoRR, 2015

In a World that Counts: Clustering and Detecting Fake Social Engagement at Scale.
CoRR, 2015

Overlapping Community Detection via Local Spectral Clustering.
CoRR, 2015

Uncovering the Small Community Structure in Large Networks: A Local Spectral Approach.
CoRR, 2015

Revealing Multiple Layers of Hidden Community Structure in Networks.
CoRR, 2015

Detecting Overlapping Communities from Local Spectral Subspaces.
CoRR, 2015

Deep Manifold Traversal: Changing Labels with Convolutional Features.
CoRR, 2015

Uncovering the Small Community Structure in Large Networks: A Local Spectral Approach.
Proceedings of the 24th International Conference on World Wide Web, 2015

Convergent Learning: Do different neural networks learn the same representations?
Proceedings of the 1st Workshop on Feature Extraction: Modern Questions and Challenges, 2015

Detecting Overlapping Communities from Local Spectral Subspaces.
Proceedings of the 2015 IEEE International Conference on Data Mining, 2015

2014
A separability framework for analyzing community structure.
TKDD, 2014

2013
Learning to predict reciprocity and triadic closure in social networks.
TKDD, 2013

Extracting the Core Structure of Social Networks Using (α, β)-Communities.
Internet Mathematics, 2013

Sign Stable Projections, Sign Cauchy Projections and Chi-Square Kernels.
CoRR, 2013

Sign Cauchy Projections and Chi-Square Kernel.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

2012
Using community information to improve the precision of link prediction methods.
Proceedings of the 21st World Wide Web Conference, 2012

On the Impact of Turing Machines.
Proceedings of the Theory and Applications of Models of Computation, 2012

Feature-Enhanced Probabilistic Models for Diffusion Network Inference.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2012

On the separability of structural classes of communities.
Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

Future Directions in Computer Science Research.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Making the World a Better Place.
Proceedings of the Logic and Program Semantics, 2012

Use of Supervised Learning to Predict Directionality of Links in a Network.
Proceedings of the Advanced Data Mining and Applications, 8th International Conference, 2012

Information, Data, Security in a Networked Future.
Proceedings of the ACM Turing Centenary Celebration, 2012

2011
The Future of Computer Science.
Int. J. Software and Informatics, 2011

The web of topics: discovering the topology of topic evolution in a corpus.
Proceedings of the 20th International Conference on World Wide Web, 2011

Detecting the Structure of Social Networks Using (α, β)-Communities.
Proceedings of the Algorithms and Models for the Web Graph - 8th International Workshop, 2011

Detecting Community Kernels in Large Social Networks.
Proceedings of the 11th IEEE International Conference on Data Mining, 2011

Who will follow you back?: reciprocal relationship prediction.
Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

2010
Community Structure in Large Complex Networks.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Recovering Social Networks from Contagion Information.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

New Research Directions in the Information Age.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

2008
Manipulation-Resistant Reputations Using Hitting Time.
Internet Mathematics, 2008

Local Computation of PageRank Contributions.
Internet Mathematics, 2008

On the Stability of Web Crawling and Web Search.
Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Computer Science in the Information Age.
Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

Robust PageRank and locally computable spam detection features.
Proceedings of the AIRWeb 2008, 2008

2007
Finding (Short) Paths in Social Networks.
Internet Mathematics, 2007

Manipulation-Resistant Reputations Using Hitting Time.
Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007

Local Computation of PageRank Contributions.
Proceedings of the Algorithms and Models for the Web-Graph, 5th International Workshop, 2007

Spectral clustering with limited independence.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006
Spectral Clustering by Recursive Partitioning.
Proceedings of the Algorithms, 2006

2005
Correctness of a gossip based membership protocol.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Error bounds for correlation clustering.
Proceedings of the Machine Learning, 2005

On Learning Mixtures of Heavy-Tailed Distributions.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004
Spectral Analysis of Random Graphs with Skewed Degree Distributions.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003
Natural communities in large linked networks.
Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 24, 2003

Introduction to automata theory, languages, and computation - international edition (2. ed).
Addison-Wesley, ISBN: 978-0-321-21029-6, 2003

2002
Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie (2. Aufl.).
Pearson Studium, ISBN: 978-3-8273-7020-4, 2002

2001
Introduction to automata theory, languages, and computation, 2nd edition.
SIGACT News, 2001

Introduction to automata theory, languages, and computation - (2. ed.).
Addison-Wesley series in computer science, Addison-Wesley-Longman, ISBN: 978-0-201-44124-6, 2001

2000
Automata Theory: Its Past and Future.
Proceedings of the A Half-Century of Automata Theory: Celebration and Inspiration, 2000

Introduction to Automata Theory, Languages and Computation, Second Edition
Addison-Wesley, 2000

1994
Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie (3. Aufl.).
Internationale Computer-Bibliothek, Addison-Wesley, ISBN: 978-3-89319-744-6, 1994

1992
A Paradigm for Robust Geometric Algorithms.
Algorithmica, 1992

1991
A Case Study of Flexible Object Manipulation.
I. J. Robotics Res., 1991

1990
Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie (2. Aufl.).
Internationale Computer-Bibliothek, Addison-Wesley, ISBN: 978-3-89319-181-9, 1990

1989
Electronic Prototyping.
IEEE Computer, 1989

Robust set operations on polyhedral solids.
IEEE Computer Graphics and Applications, 1989

Computer science - achievements and opportunities.
SIAM, ISBN: 978-0-87871-236-6, 1989

1988
Tracing surface intersections.
Computer Aided Geometric Design, 1988

The Geometry of Projective Blending Surfaces.
Artif. Intell., 1988

Towards Implementing Robust Geometric Computations.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987
Simulation of physical systems from geometric models.
IEEE J. Robotics and Automation, 1987

Computer Science: The Emergence of a Discipline.
Commun. ACM, 1987

1986
Reducing Multiple Object Motion Planning to Graph Searching.
SIAM J. Comput., 1986

The Impact of Robotics on Computer Science.
Commun. ACM, 1986

The Promise of Electronic Prototyping.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985
Automatic surface generation in computer aided design.
The Visual Computer, 1985

On the Movement of Robot Arms in 2-Dimensional Bounded Regions.
SIAM J. Comput., 1985

Decreasing the Nesting Depth of Expressions Involving Square Roots.
J. Symb. Comput., 1985

Routing, Merging, and Sorting on Parallel Models of Computation.
J. Comput. Syst. Sci., 1985

Representation, manipulation, and reasoning about physical objects.
Proceedings of the 1985 IEEE International Conference on Robotics and Automation, 1985

1984
Movement Problems for 2-Dimensional Linkages.
SIAM J. Comput., 1984

1983
Data Structures and Algorithms.
Addison-Wesley, ISBN: 0-201-00023-7, 1983

1982
Fast Parallel Matrix and GCD Computations
Information and Control, March, 1982

On Edge Coloring Bipartite Graphs.
SIAM J. Comput., 1982

Routing, Merging and Sorting on Parallel Models of Computation (Extended Abstract)
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

On the Movement of Robot Arms in 2-Dimensional Bounded Regions
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

Fast Parallel Matrix and GCD Computations
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1981
Recent Directions in Algorithmic Research.
Proceedings of the Theoretical Computer Science, 1981

1980
The Directed Subgraph Homeomorphism Problem.
Theor. Comput. Sci., 1980

Polynomial-Time Algorithms for Permutation Groups
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979
On the Reachability Problem for 5-Dimensional Vector Addition Systems.
Theor. Comput. Sci., 1979

A Note on Rabin's Nearest-Neighbor Algorithm.
Inf. Process. Lett., 1979

Introduction to Automata Theory, Languages and Computation.
Addison-Wesley, ISBN: 0-201-02988-X, 1979

1978
The Complexity of Equivalence and Containment for Free Single Variable Program Schemes.
Proceedings of the Automata, 1978

1977
On Time Versus Space.
J. ACM, 1977

1976
On Finding Lowest Common Ancestors in Trees.
SIAM J. Comput., 1976

1975
On Time versus Space and Related Problems
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

1974
Efficient Planarity Testing.
J. ACM, 1974

Linear Time Algorithm for Isomorphism of Planar Graphs (Preliminary Report)
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

Complexity of Computer Computations.
IFIP Congress, 1974

The Design and Analysis of Computer Algorithms.
Addison-Wesley, ISBN: 0-201-00029-6, 1974

1973
Set Merging Algorithms.
SIAM J. Comput., 1973

Dividing a Graph into Triconnected Components.
SIAM J. Comput., 1973

Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms.
SIAM J. Comput., 1973

An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs.
SIAM J. Comput., 1973

A V log V Algorithm for Isomorphism of Triconnected Planar Graphs.
J. Comput. Syst. Sci., 1973

Efficient Algorithms for Graph Manipulation [H] (Algorithm 447).
Commun. ACM, 1973

Duality Applied to the Complexity of Matrix Multiplications and other Bilinear Forms
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30, 1973

On Finding Lowest Common Ancestors in Trees
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30, 1973

1972
Isomorphism of Planar Graphs.
Proceedings of a symposium on the Complexity of Computer Computations, 1972

1971
Images of AFL under Certain Families of Homomorphisms.
Mathematical Systems Theory, 1971

An Overview of the Theory of Computational Complexity.
J. ACM, 1971

A V² Algorithm for Determining Isomorphism of Planar Graphs.
Inf. Process. Lett., 1971

Planarity Testing in V log V Steps: Extended Abstract.
IFIP Congress (1), 1971

A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs
Proceedings of the 12th Annual Symposium on Switching and Automata Theory, 1971

1970
R70-2 Nested Stack Automata.
IEEE Trans. Computers, 1970

What makes Some Language Theory Problems Undecidable.
J. Comput. Syst. Sci., 1970

On the Computational Power of Pushdown Automata.
J. Comput. Syst. Sci., 1970

Two-way balloon automata and AFL.
J. ACM, 1970

1969
On the Equivalence and Containment Problems for Context-Free Languages.
Mathematical Systems Theory, 1969

A General Theory of Translation.
Mathematical Systems Theory, 1969

Scattered Context Grammars.
J. Comput. Syst. Sci., 1969

Some Results on Tape-Bounded Turing Machines.
J. ACM, 1969

Some Techniques for Proving Certain Simple Programs Optimal
Proceedings of the 10th Annual Symposium on Switching and Automata Theory, 1969

Dense and Non-Dense Families of Complexity Classes
Proceedings of the 10th Annual Symposium on Switching and Automata Theory, 1969

Formal languages and their relation to automata.
Addison-Wesley series in computer science and information processing, Addison-Wesley, ISBN: 0201029839, 1969

1968
Time and Tape Complexity of Pushdown Automaton Languages
Information and Control, September, 1968

Sets Accepted by One-Way Stack Automata Are Context Sensitive
Information and Control, August, 1968

Deterministic Stack Automata and the Quotient Operator.
J. Comput. Syst. Sci., 1968

Relations Between Time and Tape Complexities.
J. ACM, 1968

Decidable and Undecidable Questions About Automata.
J. ACM, 1968

Scattered context grammars.
IFIP Congress (1), 1968

Structure of Undecidable Problems in Automata Theory
Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

Two-Way Balloon Automata and AFL
Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

1967
Nonerasing Stack Automata.
J. Comput. Syst. Sci., 1967

Modular Decomposition of Synchronous Sequential Machines
Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

An Approach to a Unified Theory of Automata
Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

Two Results on One-Way Stack Automata
Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

1966
Encoding of analog signals for binary symmetric channels.
IEEE Trans. Information Theory, 1966

Simple Deterministic Languages
Proceedings of the 7th Annual Symposium on Switching and Automata Theory, 1966

1965
Synthesis of Minimal Threshold Logic Networks.
IEEE Trans. Electronic Computers, 1965


  Loading...