Вы здесь

Главная

J. of the ACM

Связанные издания:

On the Power of Bounded Concurrency I: Finite Automata
On the Power of Bounded Concurrency II: Pushdown Automata
Parallel Queues with Resequencing
Perfectly Secure Message Transmission
Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling
Randomized Parallel Algorithms for Backtrack Search and Branch-and-Bound Computation
Reasoning About Knowledge and Probability
Simulating Synchronized Clocks and Common Knowledge in Distributed Systems
Syntactical Characterization of a Subset of Domain-Independent Formulas
Taking Random Walks to Grow Trees in Hypercubes
Termination, Deadlock, and Divergence
The Elusive Atomic Register
The Generation of Binary Trees as a Numerical Problem
The Impossibility of Implementing Reliable Communication in the Face of Crashes
The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial
Theorem Proving Using Equational Matings and Regid E-Unification
The Parallel Complexity of Simple Logic Programs
The Relationship between Greedy Parsing and Symbolwise Text Compression
Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings
Undecidable Optimization Problems for Database Logic Programs
Unification in Commutative Theories, Hilbert s Basis Theorem, and Groibner Bases
Union-Copy Structures and Dynamic Segment Trees
What Can Machines Know? On the Properties of Knowledge in Distributes Systems
Z-Module Reasoning: An Equality-Oriented Proving Method with Built-in Ring Axioms