The following pages link to Journal of the ACM (Q63915):
Displayed 50 items.
- The effectiveness of lloyd-type methods for the k-means problem (Q63920) (← links)
- Iterative Procedures for Nonlinear Integral Equations (Q84502) (← links)
- Plane formation by synchronous mobile robots in the three dimensional Euclidean space (Q1664133) (← links)
- Towards verifying nonlinear integer arithmetic (Q2164225) (← links)
- Truthful Mechanisms with Implicit Payment Computation (Q2796397) (← links)
- Recursive Markov Decision Processes and Recursive Stochastic Games (Q2796398) (← links)
- Document Spanners (Q2796400) (← links)
- Finding Correlations in Subquadratic Time, with Applications to Learning Parities and the Closest Pair Problem (Q2796401) (← links)
- Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems (Q2796402) (← links)
- Monitoring Metric First-Order Temporal Properties (Q2796403) (← links)
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)
- Polyhedral Clinching Auctions and the AdWords Polytope (Q2796405) (← links)
- Schaefer's Theorem for Graphs (Q2796406) (← links)
- New Strong Direct Product Results in Communication Complexity (Q2796407) (← links)
- Learning without Concentration (Q2796408) (← links)
- A Framework for Space Complexity in Algebraic Proof Systems (Q2796410) (← links)
- On Kinetic Delaunay Triangulations (Q2796411) (← links)
- Lower bounds for local approximation (Q2933794) (← links)
- Divide-and-conquer approximation algorithms via spreading metrics (Q2939194) (← links)
- 2-Server PIR with Sub-Polynomial Communication (Q2941552) (← links)
- The space complexity of long-lived and one-shot timestamp implementations (Q2943392) (← links)
- Building tractable disjunctive constraints (Q2946994) (← links)
- A neuroidal architecture for cognitive computation (Q2946995) (← links)
- Sliver exudation (Q2946996) (← links)
- A lower bound on the average-case complexity of shellsort (Q2946997) (← links)
- Tight bounds for <i>k</i> -set agreement (Q2946999) (← links)
- Periodification scheme (Q2947000) (← links)
- Dynamic planar convex hull operations in near-logarithmic amortized time (Q2947001) (← links)
- Adversarial queuing theory (Q2947002) (← links)
- Universal-stability results and performance bounds for greedy contention-resolution protocols (Q2947003) (← links)
- Automated complexity analysis based on ordered resolution (Q2947004) (← links)
- Lattice computers for approximating Euclidean space (Q2947005) (← links)
- a counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution (Q2947006) (← links)
- The structure of inverses in schema mappings (Q2999780) (← links)
- A random-sampling-based algorithm for learning intersections of halfspaces (Q2999781) (← links)
- Newtonian program analysis (Q2999782) (← links)
- Epistemic privacy (Q2999783) (← links)
- Approximation algorithms for restless bandit problems (Q2999784) (← links)
- XML with incomplete information (Q2999785) (← links)
- On P vs. NP and geometric complexity theory (Q3016252) (← links)
- Delaunay triangulations in <i>O</i> (sort( <i>n</i> )) time and more (Q3016253) (← links)
- Dynamic atomic storage without consensus (Q3016254) (← links)
- Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix (Q3016255) (← links)
- Market equilibrium under separable, piecewise-linear, concave utilities (Q3016257) (← links)
- Robust principal component analysis? (Q3016258) (← links)
- Estimating PageRank on graph streams (Q3016259) (← links)
- Time-Space trade-offs for some algebraic problems (Q3026340) (← links)
- Refining Nondeterminism in Relativizations of Complexity Classes (Q3026342) (← links)
- On the Desirability of Acyclic Database Schemes (Q3026382) (← links)
- Degrees of acyclicity for hypergraphs and relational database schemes (Q3026383) (← links)