The following pages link to Journal of the ACM (Q63915):
Displayed 50 items.
- Graph Algorithms for Functional Dependency Manipulation (Q3026384) (← links)
- Three-Dimensional VLSI (Q3026917) (← links)
- Information Transfer in Distributed Computing with Applications to VLSI (Q3028340) (← links)
- The Complexity of Solving Polynomial Equations by Quadrature (Q3028341) (← links)
- Random Trees and the Analysis of Branch and Bound Procedures (Q3028342) (← links)
- The polynomial-time hierarchy and sparse oracles (Q3028343) (← links)
- Some Hamilton Paths and a Minimal Change Algorithm (Q3028353) (← links)
- The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees (Q3028354) (← links)
- Syntactic Characterization of Tree Database Schemas (Q3028374) (← links)
- Locking Protocols (Q3028375) (← links)
- Analysis of Uniform Hashing (Q3028377) (← links)
- Bounding Fan-out in Logical Networks (Q3030723) (← links)
- A Machine Representation of Finite <i>T</i> <sub>0</sub> Topologies (Q3047880) (← links)
- Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs (Q3048268) (← links)
- Applications of Path Compression on Balanced Trees (Q3048273) (← links)
- A Linear Time Planarity Algorithm for 2-Complexes (Q3048280) (← links)
- Flow Switching Approach to the Maximum Flow Problem: I (Q3048614) (← links)
- Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines (Q3069900) (← links)
- The random oracle methodology, revisited (Q3069902) (← links)
- Approximating extent measures of points (Q3069903) (← links)
- Edge-disjoint routing in plane switch graphs in linear time (Q3069904) (← links)
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries (Q3069905) (← links)
- Almost tight upper bounds for vertical decompositions in four dimensions (Q3069906) (← links)
- Automatic information extraction from large websites (Q3069908) (← links)
- Self-stabilizing clock synchronization in the presence of Byzantine faults (Q3069909) (← links)
- A unified theory of shared memory consistency (Q3069911) (← links)
- Random walks on weighted graphs and applications to on-line algorithms (Q3140012) (← links)
- Randomized algorithms and pseudorandom numbers (Q3140013) (← links)
- Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases (Q3140014) (← links)
- Dissolution (Q3140015) (← links)
- Factorization and circuit in the connection method (Q3140016) (← links)
- Z-module reasoning (Q3140017) (← links)
- Constant depth circuits, Fourier transform, and learnability (Q3140018) (← links)
- Dynamic interpolation search (Q3140019) (← links)
- Union-copy structures and dynamic segment trees (Q3140020) (← links)
- Decidability of bisimulation equivalence for process generating context-free languages (Q3140021) (← links)
- Undecidable optimization problems for database logic programs (Q3140022) (← links)
- A performance evaluation of several priority policies for parallel processing systems (Q3140023) (← links)
- Taking random walks to grow trees in hypercubes (Q3140024) (← links)
- Randomized parallel algorithms for backtrack search and branch-and-bound computation (Q3140025) (← links)
- Efficient descriptor-vector multiplications in stochastic automata networks (Q3158510) (← links)
- Lower bounds for distributed coin-flipping and randomized consensus (Q3158511) (← links)
- Fault-tolerant wait-free shared objects (Q3158512) (← links)
- Proof verification and the hardness of approximation problems (Q3158513) (← links)
- Formal verification of complex coherence protocols using symbolic state models (Q3158515) (← links)
- On the decidability and axiomatization of query finiteness in deductive databases (Q3158516) (← links)
- A threshold of ln <i>n</i> for approximating set cover (Q3158517) (← links)
- Property testing and its connection to learning and approximation (Q3158518) (← links)
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems (Q3158519) (← links)
- Beyond the flow decomposition barrier (Q3158520) (← links)