John E. Hopcroft

CoRR, 2019

Computational sustainability: computing for a better world and a sustainable future.

[BibT_eX]

[DOI]

Commun. ACM, 2019

Improving the Generalization of Adversarial Training with Domain Adaptation.

[BibT_eX]

[DOI]

Proceedings of the 7th International Conference on Learning Representations, 2019

Adaptive Wavelet Clustering for Highly Noisy Data.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

2018

Local Spectral Clustering for Overlapping Community Detection.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2018

Neighbourhood-preserving dimension reduction via localised multidimensional scaling.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Hidden community detection in social networks.

[BibT_eX]

[DOI]

Inf. Sci., 2018

Towards Understanding Learning Representations: To What Extent Do Different Neural Networks Learn the Same Representation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Curvature-based Comparison of Two Neural Networks.

[BibT_eX]

[DOI]

Tao Yu

Huan Long

Proceedings of the 24th International Conference on Pattern Recognition, 2018

2017

Krylov Subspace Approximation for Local Community Detection.

[BibT_eX]

[DOI]

CoRR, 2017

The Local Dimension of Deep Manifold.

[BibT_eX]

[DOI]

CoRR, 2017

Understanding Deep Representations through Random Weights.

[BibT_eX]

[DOI]

CoRR, 2017

Computer Science in the Information Age.

[BibT_eX]

[DOI]

Kun He

IEEE Intell. Informatics Bull., 2017

Local Lanczos Spectral Approximation for Community Detection.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2017

Learning Latent Topics from the Word Co-occurrence Network.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science - 35th National Conference, 2017

Deep Compression on Convolutional Neural Network for Artistic Style Transfer.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science - 35th National Conference, 2017

Snapshot Ensembles: Train 1, Get M for Free.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Learning Representations, 2017

Stacked Generative Adversarial Networks.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Conference on Computer Vision and Pattern Recognition, 2017

2016

Special Issue for FAW 2014.

[BibT_eX]

[DOI]

Jianer Chen

J. Comb. Optim., 2016

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

[BibT_eX]

[DOI]

Proceedings of the 4th International Conference on Learning Representations, 2016

The Lifecycle and Cascade of WeChat Social Messaging Groups.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on World Wide Web, 2016

In a World That Counts: Clustering and Detecting Fake Social Engagement at Scale.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on World Wide Web, 2016

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

[BibT_eX]

[DOI]

Kun He

Yan Wang

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.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, 10th International Workshop, 2016

2015

Use of Local Group Information to Identify Communities in Networks.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2015

Frontiers of Algorithmics.

[BibT_eX]

[DOI]

Jianer Chen

Theor. Comput. Sci., 2015

The Lifecycle and Cascade of Social Messaging Groups.

[BibT_eX]

[DOI]

CoRR, 2015

Overlapping Community Detection via Local Spectral Clustering.

[BibT_eX]

[DOI]

CoRR, 2015

Revealing Multiple Layers of Hidden Community Structure in Networks.

[BibT_eX]

[DOI]

CoRR, 2015

Deep Manifold Traversal: Changing Labels with Convolutional Features.

[BibT_eX]

[DOI]

CoRR, 2015

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

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on World Wide Web, 2015

Detecting Overlapping Communities from Local Spectral Subspaces.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Conference on Data Mining, 2015

2014

A separability framework for analyzing community structure.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2014

2013

Learning to predict reciprocity and triadic closure in social networks.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2013

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

[BibT_eX]

[DOI]

Supasorn Suwajanakorn

Internet Math., 2013

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

[BibT_eX]

[DOI]

Ping Li

Gennady Samorodnitsky

CoRR, 2013

Sign Cauchy Projections and Chi-Square Kernel.

[BibT_eX]

[DOI]

Ping Li

Gennady Samorodnitsky

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.

[BibT_eX]

[DOI]

Proceedings of the 21st World Wide Web Conference, 2012

On the Impact of Turing Machines.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2012

Feature-Enhanced Probabilistic Models for Diffusion Network Inference.

[BibT_eX]

[DOI]

Stefano Ermon

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2012

On the separability of structural classes of communities.

[BibT_eX]

[DOI]

Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2012

Future Directions in Computer Science Research.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Making the World a Better Place.

[BibT_eX]

[DOI]

Proceedings of the Logic and Program Semantics, 2012

Use of Supervised Learning to Predict Directionality of Links in a Network.

[BibT_eX]

[DOI]

Proceedings of the Advanced Data Mining and Applications, 8th International Conference, 2012

Information, Data, Security in a Networked Future.

[BibT_eX]

[DOI]

Proceedings of the ACM Turing Centenary Celebration, 2012

2011

The Future of Computer Science.

[BibT_eX]

[DOI]

Int. J. Softw. Informatics, 2011

The web of topics: discovering the topology of topic evolution in a corpus.

[BibT_eX]

[DOI]

Yookyung Jo

Carl Lagoze

Proceedings of the 20th International Conference on World Wide Web, 2011

Detecting the Structure of Social Networks Using (α, β)-Communities.

[BibT_eX]

[DOI]

Jing He

Hongyu Liang

Supasorn Suwajanakorn

Proceedings of the Algorithms and Models for the Web Graph - 8th International Workshop, 2011

Detecting Community Kernels in Large Social Networks.

[BibT_eX]

[DOI]

Proceedings of the 11th IEEE International Conference on Data Mining, 2011

Who will follow you back?: reciprocal relationship prediction.

[BibT_eX]

[DOI]

Tiancheng Lou

Jie Tang

Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

2010

Community Structure in Large Complex Networks.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Recovering Social Networks from Contagion Information.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

New Research Directions in the Information Age.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

2008

Manipulation-Resistant Reputations Using Hitting Time.

[BibT_eX]

[DOI]

Daniel Sheldon

Internet Math., 2008

Local Computation of PageRank Contributions.

[BibT_eX]

[DOI]

Internet Math., 2008

On the Stability of Web Crawling and Web Search.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 19th International Symposium, 2008

Computer Science in the Information Age.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics, Second Annual International Workshop, 2008

Robust PageRank and locally computable spam detection features.

[BibT_eX]

[DOI]

Proceedings of the AIRWeb 2008, 2008

2007

Finding (Short) Paths in Social Networks.

[BibT_eX]

[DOI]

Internet Math., 2007

Spectral clustering with limited independence.

[BibT_eX]

[DOI]

Anirban Dasgupta

Pradipta Prometheus Mitra

Ravi Kannan

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Introduction to automata theory, languages, and computation, 3rd Edition.

[BibT_eX]

Pearson international edition, Addison-Wesley, ISBN: 978-0-321-47617-3, 2007

2006

Spectral Clustering by Recursive Partitioning.

[BibT_eX]

[DOI]

Anirban Dasgupta

Pradipta Prometheus Mitra

Ravi Kannan

Proceedings of the Algorithms, 2006

2005

Correctness of a gossip based membership protocol.

[BibT_eX]

[DOI]

André Allavena

Alan J. Demers

Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

Error bounds for correlation clustering.

[BibT_eX]

[DOI]

Thorsten Joachims

Proceedings of the Machine Learning, 2005

On Learning Mixtures of Heavy-Tailed Distributions.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Anirban Dasgupta

Frank McSherry

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003

Natural communities in large linked networks.

[BibT_eX]

[DOI]

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, 2nd Edition.

[BibT_eX]

Addison-Wesley, ISBN: 978-0-321-21029-6, 2003

2002

Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie (2. Aufl.).

[BibT_eX]

Pearson Studium, ISBN: 978-3-8273-7020-4, 2002

2001

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

[BibT_eX]

[DOI]

SIGACT News, 2001

Introduction to automata theory, languages, and computation, 2nd Edition.

[BibT_eX]

Addison-Wesley series in computer science, Addison-Wesley-Longman, ISBN: 978-0-201-44124-6, 2001

2000

Automata Theory: Its Past and Future.

[BibT_eX]

Proceedings of the A Half-Century of Automata Theory: Celebration and Inspiration, 2000

Introduction to Automata Theory, Languages and Computation, Second Edition

[BibT_eX]

Addison-Wesley, 2000

1994

Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie (3. Aufl.).

[BibT_eX]

Internationale Computer-Bibliothek, Addison-Wesley, ISBN: 978-3-89319-744-6, 1994

1992

A Paradigm for Robust Geometric Algorithms.

[BibT_eX]

[DOI]

Peter J. Kahn

Algorithmica, 1992

1991

A Case Study of Flexible Object Manipulation.

[BibT_eX]

[DOI]

Joseph K. Kearney

Dean B. Krafft

Int. J. Robotics Res., 1991

1990

Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie (2. Aufl.).

[BibT_eX]

Internationale Computer-Bibliothek, Addison-Wesley, ISBN: 978-3-89319-181-9, 1990

1989

Electronic Prototyping.

[BibT_eX]

[DOI]

Computer, 1989

Robust set operations on polyhedral solids.

[BibT_eX]

[DOI]

Michael Karasick

IEEE Computer Graphics and Applications, 1989

Computer science - achievements and opportunities.

[BibT_eX]

Kenneth W. Kennedy

SIAM, ISBN: 978-0-87871-236-6, 1989

1988

Tracing surface intersections.

[BibT_eX]

[DOI]

Chandrajit L. Bajaj

Robert E. Lynch

Comput. Aided Geom. Des., 1988

The Geometry of Projective Blending Surfaces.

[BibT_eX]

[DOI]

Artif. Intell., 1988

Towards Implementing Robust Geometric Computations.

[BibT_eX]

[DOI]

Michael S. Karasick

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987

Simulation of physical systems from geometric models.

[BibT_eX]

[DOI]

IEEE J. Robotics Autom., 1987

Computer Science: The Emergence of a Discipline.

[BibT_eX]

[DOI]

Commun. ACM, 1987

1986

Reducing Multiple Object Motion Planning to Graph Searching.

[BibT_eX]

[DOI]

Gordon T. Wilfong

SIAM J. Comput., 1986

The Impact of Robotics on Computer Science.

[BibT_eX]

[DOI]

Commun. ACM, 1986

The Promise of Electronic Prototyping.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985

Automatic surface generation in computer aided design.

[BibT_eX]

[DOI]

Vis. Comput., 1985

On the Movement of Robot Arms in 2-Dimensional Bounded Regions.

[BibT_eX]

[DOI]

Deborah Joseph

Sue Whitesides

SIAM J. Comput., 1985

Decreasing the Nesting Depth of Expressions Involving Square Roots.

[BibT_eX]

[DOI]

J. Symb. Comput., 1985

Routing, Merging, and Sorting on Parallel Models of Computation.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1985

1984

Movement Problems for 2-Dimensional Linkages.

[BibT_eX]

[DOI]

Deborah Joseph

Sue Whitesides

SIAM J. Comput., 1984

1983

Data Structures and Algorithms.

[BibT_eX]

Addison-Wesley, ISBN: 0-201-00023-7, 1983

1982

Fast Parallel Matrix and GCD Computations

[BibT_eX]

[DOI]

Joachim von zur Gathen

Inf. Control., March, 1982

On Edge Coloring Bipartite Graphs.

[BibT_eX]

[DOI]

Richard Cole

SIAM J. Comput., 1982

Routing, Merging and Sorting on Parallel Models of Computation (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

1981

Recent Directions in Algorithmic Research.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1981

1980

The Directed Subgraph Homeomorphism Problem.

[BibT_eX]

[DOI]

Steven Fortune

James Wyllie

Theor. Comput. Sci., 1980

Polynomial-Time Algorithms for Permutation Groups

[BibT_eX]

[DOI]

Merrick L. Furst

Eugene M. Luks

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979

On the Reachability Problem for 5-Dimensional Vector Addition Systems.

[BibT_eX]

[DOI]

Jean-Jacques Pansiot

Theor. Comput. Sci., 1979

A Note on Rabin's Nearest-Neighbor Algorithm.

[BibT_eX]

[DOI]

Steven Fortune

Inf. Process. Lett., 1979

Introduction to Automata Theory, Languages and Computation.

[BibT_eX]

Addison-Wesley, ISBN: 0-201-02988-X, 1979

1978

The Complexity of Equivalence and Containment for Free Single Variable Program Schemes.

[BibT_eX]

[DOI]

Steven Fortune

Erik Meineche Schmidt

Proceedings of the Automata, 1978

1977

On Time Versus Space.

[BibT_eX]

[DOI]

Wolfgang J. Paul

Leslie G. Valiant

J. ACM, 1977

1976

Independence results in computer science.

[BibT_eX]

[DOI]

SIGACT News, 1976

On Finding Lowest Common Ancestors in Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 1976

1975

On Time versus Space and Related Problems

[BibT_eX]

[DOI]

Wolfgang J. Paul

Leslie G. Valiant

Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

1974

Efficient Planarity Testing.

[BibT_eX]

[DOI]

J. ACM, 1974

Linear Time Algorithm for Isomorphism of Planar Graphs (Preliminary Report)

[BibT_eX]

[DOI]

J. K. Wong

Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

Complexity of Computer Computations.

[BibT_eX]

Proceedings of the Information Processing, 1974

The Design and Analysis of Computer Algorithms.

[BibT_eX]

Addison-Wesley, ISBN: 0-201-00029-6, 1974

1973

Set Merging Algorithms.

[BibT_eX]

[DOI]

SIAM J. Comput., 1973

Dividing a Graph into Triconnected Components.

[BibT_eX]

[DOI]

SIAM J. Comput., 1973

Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms.

[BibT_eX]

[DOI]

Jean E. Musinski

SIAM J. Comput., 1973

An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs.

[BibT_eX]

[DOI]

Richard M. Karp

SIAM J. Comput., 1973

A V log V Algorithm for Isomorphism of Triconnected Planar Graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1973

Efficient Algorithms for Graph Manipulation [H] (Algorithm 447).

[BibT_eX]

[DOI]

Commun. ACM, 1973

Duality Applied to the Complexity of Matrix Multiplications and other Bilinear Forms

[BibT_eX]

[DOI]

Jean E. Musinski

Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30, 1973

1972

Isomorphism of Planar Graphs.

[BibT_eX]

[DOI]

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

1971

Images of AFL under Certain Families of Homomorphisms.

[BibT_eX]

[DOI]

Seymour Ginsburg

Math. Syst. Theory, 1971

An Overview of the Theory of Computational Complexity.

[BibT_eX]

[DOI]

J. ACM, 1971

A V² Algorithm for Determining Isomorphism of Planar Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1971

Planarity Testing in V log V Steps: Extended Abstract.

[BibT_eX]

Proceedings of the Information Processing, Proceedings of IFIP Congress 1971, Volume 1, 1971

A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs

[BibT_eX]

[DOI]

Richard M. Karp

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

1970

R70-2 Nested Stack Automata.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1970

What makes Some Language Theory Problems Undecidable.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1970

On the Computational Power of Pushdown Automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1970

Two-way balloon automata and AFL.

[BibT_eX]

[DOI]

Seymour Ginsburg

J. ACM, 1970

1969

On the Equivalence and Containment Problems for Context-Free Languages.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1969

A General Theory of Translation.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1969

Scattered Context Grammars.

[BibT_eX]

[DOI]

Sheila A. Greibach

J. Comput. Syst. Sci., 1969

Some Results on Tape-Bounded Turing Machines.

[BibT_eX]

[DOI]

J. ACM, 1969

Some Techniques for Proving Certain Simple Programs Optimal

[BibT_eX]

[DOI]

L. R. Kerr

Proceedings of the 10th Annual Symposium on Switching and Automata Theory, 1969

Dense and Non-Dense Families of Complexity Classes

[BibT_eX]

[DOI]

Robert L. Constable

Proceedings of the 10th Annual Symposium on Switching and Automata Theory, 1969

Formal languages and their relation to automata.

[BibT_eX]

[DOI]

Addison-Wesley series in computer science and information processing, Addison-Wesley, ISBN: 0201029839, 1969

1968

Time and Tape Complexity of Pushdown Automaton Languages

[BibT_eX]

[DOI]

Inf. Control., September, 1968

Sets Accepted by One-Way Stack Automata Are Context Sensitive

[BibT_eX]

[DOI]

Inf. Control., August, 1968

Deterministic Stack Automata and the Quotient Operator.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1968

Relations Between Time and Tape Complexities.

[BibT_eX]

[DOI]

J. ACM, 1968

Decidable and Undecidable Questions About Automata.

[BibT_eX]

[DOI]

J. ACM, 1968

Structure of Undecidable Problems in Automata Theory

[BibT_eX]

[DOI]

Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

A recognition algorithm for pushdown store systems.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM national conference, 1968

1967

Nonerasing Stack Automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1967

Modular Decomposition of Synchronous Sequential Machines

[BibT_eX]

[DOI]

Peter Weiner

Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

An Approach to a Unified Theory of Automata

[BibT_eX]

[DOI]

Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

Two Results on One-Way Stack Automata

[BibT_eX]

[DOI]

Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

1966

Encoding of analog signals for binary symmetric channels.

[BibT_eX]

[DOI]

Arthur J. Bernstein

Kenneth Steiglitz

IEEE Trans. Inf. Theory, 1966

Simple Deterministic Languages

[BibT_eX]

[DOI]

A. J. Korenjak

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

1965

Synthesis of Minimal Threshold Logic Networks.

[BibT_eX]

[DOI]