Machine models and linear time complexity

Two nonlinear lower bounds for on-line computations

Information and Control

An optimal lower bound for Turing machines with one work tape and a two-way input tape

Proc. of the conference on Structure in complexity theory

A model for hierarchical memory

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing

Two time-space tradeoffs for element distinctness

Theoretical Computer Science

On the power of one-way communication

Journal of the ACM (JACM)

Fast simulation of Turing machines by random access machines

SIAM Journal on Computing

Tape versus queue and stacks: the lower bounds

Information and Computation

Nondeterministic linear tasks may require substantially nonlinear deterministic time in the case of sublinear work space

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing

Nearly linear time

Logic at Botik'89 Symposium on logical foundations of computer science

A nontrivial lower bound for an NP problem on automata

SIAM Journal on Computing

The complexity of matrix transposition on one-tape off-line Turing machines

Theoretical Computer Science

A general sequential time-space tradeoff for finding unique elements

SIAM Journal on Computing

Machine models and simulations

Handbook of theoretical computer science (vol. A)

On oblivious branching programs of linear length

Information and Computation

Spatial machines: a more realistic approach to parallel computation

Communications of the ACM

Multiplication, division, and shift instructions in parallel random access machines

Theoretical Computer Science

Optimal on-line simulations of tree machines by random access machines

SIAM Journal on Computing

The power of the queue

SIAM Journal on Computing

Separating complexity classes related to &OHgr;-decision trees

Theoretical Computer Science

Nondeterminism within P

SIAM Journal on Computing

The computational complexity of universal hashing

Theoretical Computer Science - Special issue on structure in complexity theory

A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time

Information and Computation

k one-way heads cannot do string-matching

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Constant time factors do matter

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Why is Boolean complexity theory difficult?

Poceedings of the London Mathematical Society symposium on Boolean function complexity

Two-Tape Simulation of Multitape Turing Machines

Journal of the ACM (JACM)

Real-Time Simulation of Multihead Tape Units

Journal of the ACM (JACM)

Satisfiability Is Quasilinear Complete in NQL

Journal of the ACM (JACM)

Relations Among Complexity Measures

Journal of the ACM (JACM)

New Real-Time Simulations of Multihead Tape Units

Journal of the ACM (JACM)

Some combinatorial game problems require Ω(nk) time

Journal of the ACM (JACM)

RAM with Compact Memory: A Realistic and Robust Model of Computation

CSL '90 Proceedings of the 4th Workshop on Computer Science Logic

Real-time simulation of concatenable double-ended queues by double-ended queues (Preliminary Version)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)