The following pages link to Journal of the ACM (Q63915):
Displayed 50 items.
- Object identity as a query language primitive (Q3158521) (← links)
- On the space complexity of randomized synchronization (Q3158522) (← links)
- Noise-tolerant distribution-free learning of general geometric concepts (Q3158523) (← links)
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions (Q3158524) (← links)
- Electrostatic fields without singularities (Q3158525) (← links)
- Private information retrieval (Q3158526) (← links)
- Efficient noise-tolerant learning from statistical queries (Q3158527) (← links)
- Ordered chaining calculi for first-order theories of transitive relations (Q3158528) (← links)
- On parallel evaluation of game trees (Q3158529) (← links)
- Transforming cabbage into turnip (Q3158530) (← links)
- Fully dynamic planarity testing with applications (Q3158532) (← links)
- An optimality proof of the LRU- <i>K</i> page replacement algorithm (Q3158533) (← links)
- Complexity estimates depending on condition and round-off error (Q3158534) (← links)
- The computational complexity of knot and link problems (Q3158535) (← links)
- Reconstructing a three-dimensional model with arbitrary errors (Q3158536) (← links)
- The string B-tree (Q3158537) (← links)
- Provably efficient scheduling for languages with fine-grained parallelism (Q3158538) (← links)
- Some contributions to the metatheory of the situation calculus (Q3158539) (← links)
- Undirected single-source shortest paths with positive integer weights in linear time (Q3158540) (← links)
- A fast bit-vector algorithm for approximate string matching based on dynamic programming (Q3158541) (← links)
- Generation of universal series-parallel Boolean functions (Q3158543) (← links)
- Efficient algorithms for inverting evolution (Q3158544) (← links)
- Primality testing using elliptic curves (Q3158545) (← links)
- On the efficiency of pairing heaps and related data structures (Q3158546) (← links)
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation (Q3158547) (← links)
- Mutual search (Q3158548) (← links)
- New results on quantifier elimination over real closed fields and applications to constraint databases (Q3158549) (← links)
- Finding circular attributes in attribute grammars (Q3158550) (← links)
- Purely functional, real-time deques with catenation (Q3158551) (← links)
- Authoritative sources in a hyperlinked environment (Q3158552) (← links)
- Simple and efficient bounded concurrent timestamping and the traceable use abstraction (Q3158553) (← links)
- Linear hash functions (Q3158554) (← links)
- Sample-efficient strategies for learning in the presence of noise (Q3158555) (← links)
- Scheduling multithreaded computations by work stealing (Q3158556) (← links)
- Secrecy by typing in security protocols (Q3158557) (← links)
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms (Q3158558) (← links)
- Analysis of a bounding box heuristic for object intersection (Q3158559) (← links)
- The topological structure of asynchronous computability (Q3158560) (← links)
- Approximation in stochastic scheduling (Q3158561) (← links)
- Streaming Tree Transducers (Q3166998) (← links)
- Number-theoretic constructions of efficient pseudo-random functions (Q3168269) (← links)
- Robust Satisfiability of Systems of Equations (Q3177731) (← links)
- Delegating Computation (Q3177732) (← links)
- Algorithmic Applications of Baur-Strassen’s Theorem (Q3177733) (← links)
- Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata (Q3177734) (← links)
- Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time (Q3177735) (← links)
- Intrinsic Robustness of the Price of Anarchy (Q3177741) (← links)
- LSH-Preserving Functions and Their Applications (Q3177742) (← links)
- Improving Christofides' Algorithm for the s-t Path TSP (Q3177743) (← links)
- Optimal Euclidean Spanners (Q3177744) (← links)