Siam Journal on Computing

• 

  Publication Venue For

  • TREE-DEPTH AND THE FORMULA COMPLEXITY OF SUBGRAPH ISOMORPHISM.  52:273-325. 2023
  • Special Section on the 48th Annual ACM Symposium on Theory of Computing (STOC 2016).  50. 2021
  • A general framework for graph sparsification.  48:1196-1233. 2019
  • Tight bounds for online vector scheduling.  48:93-121. 2019
  • Online buy-at-bulk network design.  47:1505-1528. 2018
  • On the AC⁰ complexity of subgraph isomorphism.  46:936-971. 2017
  • Online node-weighted Steiner forest and extensions via disk paintings.  46:911-935. 2017
  • Computing correlation between piecewise-linear functions.  42:1867-1887. 2013
  • On range searching with semialgebraic sets. II.  42:2039-2062. 2013
  • Embeddings of surfaces, curves, and moving points in euclidean space.  42:442-458. 2013
  • Tile complexity of linear assemblies.  41:1051-1073. 2012
  • An optimal dynamic data structure for stabbing-semigroup queries.  41:104-127. 2012
  • A constant factor approximation for the single sink edge installation problem.  38:2426-2442. 2009
  • Cost-Distance: Two Metric Network Design.  38:1648-1659. 2008
  • Computing maximally separated sets in the plane.  36:815-834. 2006
  • Pseudo-line arrangements: Duality, algorithms, and applications.  34:526-552. 2005
  • Local search heuristics for k-median and facility location problems.  33:544-562. 2004
  • On frictional mechanical systems and their computational power.  32:1449-1474. 2003
  • Curvature-constrained shortest paths in a convex polygon.  31:1814-1851. 2002
  • Nonuniform discretization for kinodynamic motion planning and its applications.  30:161-190. 2000
  • Load and availability of Byzantine quorum systems.  29:1889-1906. 2000
  • Binary space partitions for fat rectangles.  29:1422-1448. 2000
  • Approximating shortest paths on a nonconvex polyhedron.  30:1321-1340. 2000
  • Approximation algorithms for curvature-constrained shortest paths.  30:1739-1772. 2000
  • Approximate complex polynomial evaluation in near constant work per point.  28:2059-2089. 1999
  • Simple algorithms for routing on butterfly networks with bounded queues.  28:984-1003. 1999
  • Tight analyses of two local load balancing algorithms.  29:29-64. 1999
  • Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications.  29:912-953. 1999
  • Computing many faces in arrangements of lines and segments.  27:491-505. 1998
  • Constructing Levels in Arrangements and Higher Order Voronoi Diagrams.  27:654-667. 1998
  • Surface approximation and geometric partitions.  27:1016-1035. 1998
  • Computing envelopes in four dimensions with applications.  26:1714-1732. 1997
  • Error-resilient optimal data compression.  26:934-949. 1997
  • Reconfiguring arrays with faults part I: Worst-case faults.  26:1581-1611. 1997
  • Star unfolding of a polytope with applications.  26:1689-1713. 1997
  • On-line algorithms for path selection in a nonblocking network.  25:600-625. 1996
  • Ray shooting amidst convex polyhedra and polyhedral terrains in three dimensions.  25:100-116. 1996
  • NC Algorithm for scheduling unit-time jobs with arbitrary release times and deadlines.  23:185-211. 1994
  • Randomized algorithms for binary search and load balancing on fixed connection networks with geometric applications.  23:633-651. 1994
  • Counting circular arc intersections.  22:778-793. 1993
  • Fast and efficient parallel solution of sparse linear systems.  22:1227-1250. 1993
  • Ray shooting and parametric search.  22:794-806. 1993
  • On threshold circuits and polynomial computation.  21:896-908. 1992
  • Parallel tree contraction. Part 2. Further applications.  20:1128-1147. 1991
  • Optimal size integer division circuits.  19:912-924. 1990
  • Red-blue intersection detection algorithms, with applications to motion planning and collision detection.  19:297-321. 1990
  • Optimal and sublogarithmic time randomized parallel sorting algorithms.  18:594-607. 1989
  • Efficient parallel pseudorandom number generation.  17:404-411. 1988
  • Parallel time O(log n) acceptance of deterministic CFLs on an exclusive-write P-RAM.  17:463-485. 1988
  • LOGARITHMIC DEPTH CIRCUITS FOR ALGEBRAIC FUNCTIONS..  15:231-242. 1986
  • UNBOUNDED SPEED VARIABILITY IN DISTRIBUTED COMMUNICATIONS SYSTEMS..  14:75-92. 1985
  • ON SYNCHRONOUS PARALLEL COMPUTATIONS WITH INDEPENDENT PROBABILISTIC CHOICE..  13:46-56. 1984
  • Caching with Time Windows and Delays.  51:975-1017. 2022
  • Formulas versus circuits for small distance connectivity 2018
  • Computing a nonnegative matrix factorization-provably 2016
  • The monotone complexity of k-clique on random graphs 2014