The following pages link to John Hopcroft (Q1063632):
Displaying 47 items.
- (Q4066629) (← links)
- (Q4072875) (← links)
- On Finding Lowest Common Ancestors in Trees (Q4089769) (← links)
- (Q4091421) (← links)
- On Time Versus Space (Q4131020) (← links)
- (Q4160379) (← links)
- Triangular Factorization and Inversion by Fast Matrix Multiplication (Q4402461) (← links)
- Introduction to automata theory, languages, and computation. (Q4506483) (← links)
- Nonlinear Dimension Reduction by Local Multidimensional Scaling (Q4632181) (← links)
- Fast parallel matrix and GCD computations (Q4745254) (← links)
- Dividing a Graph into Triconnected Components (Q4767335) (← links)
- (Q4773298) (← links)
- (Q4778264) (← links)
- (Q4778267) (← links)
- (Q4851834) (← links)
- Isomorphism of Planar Graphs (Working Paper) (Q4999429) (← links)
- Correctness of a gossip based membership protocol (Q5177252) (← links)
- Foundations of Data Science (Q5215510) (← links)
- Extracting the Core Structure of Social Networks Using (α, β)-Communities (Q5300789) (← links)
- (Q5421697) (← links)
- Spectral Clustering by Recursive Partitioning (Q5449533) (← links)
- (Q5450093) (← links)
- Manipulation-Resistant Reputations Using Hitting Time (Q5458301) (← links)
- Synthesis of Minimal Threshold Logic Networks (Q5523304) (← links)
- Decidable and Undecidable Questions About Automata (Q5536636) (← links)
- An Approach to a Unified Theory of Automata (Q5536637) (← links)
- Relations Between Time and Tape Complexities (Q5556431) (← links)
- On the equivalence and containment problems for context-free languages (Q5563366) (← links)
- A general theory of translation (Q5563368) (← links)
- On the equivalence and containment problems for context-free languages (Q5569456) (← links)
- Some Results on Tape-Bounded Turing Machines (Q5582355) (← links)
- Sets accepted by one-way stack automata are context sensitive (Q5585423) (← links)
- Studies in abstract families of languages (Q5590062) (← links)
- (Q5590813) (← links)
- (Q5592246) (← links)
- Two-way balloon automata and AFL (Q5596245) (← links)
- Encoding of analog signals for binary symmetric channels (Q5597284) (← links)
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication (Q5618880) (← links)
- Images of AFL under certain families of homomorphisms (Q5627632) (← links)
- An Overview of the Theory of Computational Complexity (Q5633652) (← links)
- (Q5639367) (← links)
- (Q5666587) (← links)
- Set Merging Algorithms (Q5667466) (← links)
- (Q5668808) (← links)
- Time and tape complexity of pushdown automaton languages (Q5672196) (← links)
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs (Q5682014) (← links)
- Finding (Short) Paths in Social Networks (Q5755199) (← links)
