Journal of the Acm

• 

  Publication Venue For

  • OptORAMa: Optimal Oblivious RAM.  70. 2022
  • Foundations of Differentially Oblivious Algorithms.  69. 2022
  • On Nonconvex Optimization for Machine Learning.  68. 2021
  • A Near-linear Time ϵ-Approximation Algorithm for Geometric Bipartite Matching.  67. 2020
  • Competitive algorithms from competitive equilibria: Non-clairvoyant scheduling under polyhedral constraints.  65. 2017
  • An average-case depth hierarchy theorem for boolean circuits.  64. 2017
  • Approximation algorithms for restless bandit problems.  58. 2010
  • Homomorphism preservation theorems.  55. 2008
  • Approximating extent measures of points.  51:606-635. 2004
  • Lenses in arrangements of pseudo-circles and their applications.  51:139-186. 2004
  • Approximating shortest paths on a convex polytope in three dimensions.  44:567-584. 1997
  • Work-preserving emulations of fixed-connection networks.  44:104-147. 1997
  • A Single-Exponential Upper Bound for Finding Shortest Paths in Three Dimensions.  41:1013-1019. 1994
  • Shortest Paths in the Plane with Polygonal Obstacles.  41:982-1012. 1994
  • Motion Planning in the Presence of Moving Obstacles.  41:764-790. 1994
  • Kinodynamic Motion Planning.  40:1048-1066. 1993
  • Optimal directory placement on disk storage devices.  35:433-446. 1988
  • A logarithmic time sort for linear size networks.  34:60-76. 1987
  • Optimum Head Separation in a Disk System with Two Read/Write Heads.  31:826-838. 1984
  • Symmetric Complementation.  31:401-421. 1984
  • Optimal Design of Linear Storage Hierarchies.  28:270-288. 1981
  • Optimal Selection of CPU Speed, Device Capacities, and File Assignments.  27:457-473. 1980