AnO(n) Algorithm for Abelianp-Group Isomorphism and anO(n log n) Algorithm for Abelian Group Isomorphism
Automaticity I: Properties of a Measure of Descriptional Complexity
Learnability: Admissible, Co-Finite, and Hypersimple Languages
Language Theoretic and Algorithmic Properties ofd-dimensional Collages and Patterns in a Grid
Concurrent Counting
New Lower Bounds and Hierarchy Results for Restricted Branching Programs
Incremental Learning from Positive Data
Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution
Towards Structured Parallel Computing on Architecture-Independent Parallel Algorithm Design for Distributed-Memory Architectures
Efficient Theoretic and Practical Algorithms for Linear Matroid Intersection Problems
A Space Efficient Variant of Path Copying for Partially Persistent Sorted Sets