Вы здесь

Главная

J. of the ACM

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

A Four Russians Algorithm for Regular Expression Pattern Matching
A Framework for Defining Logics
A General Approach to Connected-Component Labeling for Arbitrary Image Representations
A Little Knowledge Goes a Long Way: Knowledge-Based Derivations and Correctness Proofs for a Family of Protocols
An Algebraic Theory of Graph Reduction
An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time
An Analysis of ML Typability
An Analysis of the Longest Match and the Greedy Heuristics in Text Encoding
A Performance Evaluation of Several Priority Policies for Parallel Processing Systems
Approximation Algorithms for NP-Complete Problems on Plannar Graphs
A Really Temporal Logic
Are Wait-Free Algorithms Fast?
Atomic Snapshots of Shared Memory
Biconnectivity Approximations and Graph Carvings
Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty
Channel Routing of Multiterminal Nets
Complexity and Algorithms for Reasoning about Time: A Graph-Theoretic Approach
Computing Bounds on Steady State Availability of Repairable Computer Systems
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
Dissolution: Making Paths Vanish
Diversity-Based Inference of Finite Automata
Dynamic Interpolation Search
Dynamic Programming and the Graphical Traveling Salesman Problem
Efficient Computation of Fourier Inversion for Finite Groups
Efficient Dataflow Analysis of Logic Programs
Efficient Decomposition Methods for the Analysis of Multi-Facility Blocking Models
Equational Inference, Canonical Proofs, and Proof Orderings
Experimental Scheduling of Parallel Processing with and without Real-Time Constraints
Factorization and Circuit in the Connection Method
Faster Tree Pattern Matching
Fishspear: A Priority Queue Algorithm
Generating Automatically Tuned Bitmaps from Outlines
Independence-Reducible Database Schemes
Instance Complexity
Institutions: Abstract Model Theory for Spesification and Programming
Kinodynamic Motion Planning
Knowledge, Probability, and Adversaries
Learning Read-Once Formulas with Queries
Linear Approximation of Shortest Superstrings
Modal Nonmonotonic Logics: Ranges, Characterization, Computation
Motion Planning in the Presence of Moving Obstacles
Multiobjective A
New Approximation Algorithms for Graph Coloring
Nonlinear Pattern Matching in Trees
On Binary Constraint Problems
On the Analytical Modeling of Database Concurrency Control
On the Communication Complexity of Distributed Algebraic Computation
On the Correctness of Orphan Management Algorithms
On the Optimality of Strategies for Multiple Joins