Annual Symposium on Foundations of Computer Science (Proceedings)
-
Publication Venue For
- A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs. 2022-February:1124-1134. 2022
- Towards a better approximation for SPARSEST CUT?. 270-279. 2013
- Learning topic models - Going beyond SVD. 1-10. 2012
- Inferring local homology from sampled stratified spaces. 536-546. 2007
- Protocols for asymmetric communication channels. 522-533. 1998
- Exploiting locality for data management in systems of limited bandwidth. 284-293. 1997
- Parallelizing elimination orders with linear fill. 274-283. 1997
- Efficient parallel solution of sparse eigenvalue and eigenvector problems. 123-132. 1995
- Routing on butterfly networks with random faults. 558-570. 1995
- O(n log3 n) algorithm for the real root problem. 626-635. 1993
- Using difficulty of prediction to decrease computation: Fast sort, priority queue and convex hull on entropy bounded inputs. 104-112. 1993
- Expanders might be practical: Fast algorithms for routing around faults on multibutterflies. 384-389. 1989
- Optimal parallel algorithm for graph planarity. 282-287. 1989
- On the complexity of kinodynamic planning. 306-316. 1988
- Universal packet routing algorithms. 256-269. 1988
- NEW LOWER BOUND TECHNIQUES FOR ROBOT MOTION PLANNING PROBLEMS.. 49-60. 1987
- SOME POLYNOMIAL AND TOEPLITZ MATRIX COMPUTATIONS.. 173-184. 1987
- EFFICIENT PARALLEL ALGORITHM FOR PLANARITY.. 465-477. 1986
- MOTION PLANNING IN THE PRESENCE OF MOVING OBSTACLES.. 144-154. 1985
- OPTIMAL PARALLEL ALGORITHM FOR INTEGER SORTING.. 496-504. 1985
- PARALLEL TREE CONTRACTION AND ITS APPLICATION.. 478-489. 1985
- LOGARITHMIC DEPTH CIRCUITS FOR ALGEBRAIC FUNCTIONS.. 138-145. 1983
- PARALLEL TIME O(log N) ACCEPTANCE OF DETERMINISTIC CFLs.. 290-296. 1982
- PROPOSITIONAL DYNAMIC LOGIC OF DETERMINISTIC, WELL-STRUCTURED PROGRAM.. 322-334. 1981
- COMPLEXITY OF THE MOVER'S PROBLEM AND GENERALIZATIONS.. 421-427. 1979
- MULTIPLE-PERSON ALTERNATION.. 348-363. 1979
- A Hitting Set Relaxation for k-Server and an Extension to Time-Windows 2022
- Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time 2022
- Minimum Cuts in Directed Graphs via Partial Sparsification 2022
- Deterministic min-cut in poly-logarithmic max-flows 2020
- Tree-depth and the formula complexity of subgraph isomorphism 2020
- Exponential Lower Bounds for Monotone Span Programs 2016
- Online Algorithms for Covering and Packing Problems with Convex Objectives 2016
- An Average-Case Depth Hierarchy Theorem for Boolean Circuits 2015
- Competitive Flow Time Algorithms for Polyhedral Scheduling 2015
- Online Buy-at-Bulk Network Design 2015
- The Average Sensitivity of Bounded-Depth Formulas 2015
- Tight Bounds for Online Vector Scheduling 2015
- On the AC0 complexity of subgraph isomorphism 2014
- SelfishMigrate: A scalable algorithm for non-clairvoyantly scheduling heterogeneous processors 2014
- The monotone complexity of k-clique on random graphs 2010
- Approximation algorithms for partial-information based stochastic control with Markovian rewards 2007
- Designing networks incrementally 2001
- COST-DISTANCE: Two metric network design 2000
- Hierarchical placement and network design problems 2000
- An O(n1+ε log B) algorithm for the complex roots problem 1994
- On the fault tolerance of some popular bounded-degree networks 1992
- The power of combining the techniques of algebraic and numerical computing: Improved approximate multipoint polynomial evaluation and improved multipole algorithms 1992
- Complexity of the mover's problem and generalizations 1979
- Multiple-person alternation 1979