yusuke1997/dblp-id-title huggingface dataset:
Sampling from the Potts model at low temperatures via Swendsen-Wang dynamics
On state assignments and sequential machine decompositions from S. P. partitions
How Bad is Selfish Routing?
Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry
Waring Rank, Parameterized and Exact Algorithms
Online List Labeling: Breaking the log 2 n Barrier
Welfare and Profit Maximization with Production Costs
Solving Systems of Polynomial Congruences Modulo a Large Prime (extended abstract)
The Algorithmic Aspects of the Regularity Lemma (Extended Abstract)
Toward a Theory of Enumerations
Exploring an Unknown Graph (Extended Abstract)
Coding for Computing
Group Strategyproof Mechanisms via Primal-Dual Algorithms
Finding Maximal Repetitions in a Word in Linear Time
Derandomizing Directed Random Walks in Almost-Linear Time
A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography (Abstract)
On Classifying Continuous Constraint Satisfaction problems
"Natural" Properties of Flowchart Complexity Measures
12th Annual Symposium on Switching and Automata Theory, East Lansing, Michigan, USA, October 13-15, 1971
The Sample Complexity of Up-to-ε Multi-Dimensional Revenue Maximization
Mechanizable Proofs about Parallel Processes
Homogeneous Measures and Polynomial Time Invariants
Mechanism Design for Crowdsourcing: An Optimal 1-1/e Competitive Budget-Feasible Mechanism for Large Markets
Games Against Nature (Extended Abstract)
Unique Games with Entangled Provers are Easy
Covert Multi-Party Computation
Separating MAX 2-AND, MAX DI-CUT and MAX CUT
Gradient Descent for Unbounded Convex Functions on Hadamard Manifolds and its Applications to Scaling Problems
Reducing variable dependency in combinational circuits
On-Line Indexing for General Alphabets via Predecessor Queries on Subsets of an Ordered List
LT Codes
An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q]
Regular Languages Are Testable with a Constant Number of Queries
Query Efficient PCPs with Perfect Completeness
Optimal On-Line Search and Sublinear Time Update in String Matching
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More
Fast Fault-Tolerant Concurrent Access to Shared Objects
Reliable Computation with Noisy Circuits and Decision Trees-A General n log n Lower Bound
Improved Algorithms and Analysis for Secretary Problems and Generalizations
On Decompositions of Regular Events
Best Paper Awards
A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint
From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups
On the Streaming Model Augmented with a Sorting Primitive
Fully Parallelized Multi Prover Protocols for NEXP-Time (Extended Abstract)
Efficient Compilation of Linear Recursive Programs
Area-Efficient Graph Layouts (for VLSI)
On-line Admission Control and Circuit Routing for High Performance Computing and Communication
Fast parallel circuits for the quantum Fourier transform
Learning Intersections and Thresholds of Halfspaces
Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms
A PTAS for the Steiner Forest Problem in Doubling Metrics
A Representation of Cuts within 6/5 Times the Edge Connectivity with Applications
Automata on a 2-Dimensional Tape
Verifying Groups in Linear Time
The complexity of approximating averages on bounded-degree graphs
The Compilation of Regular Expressions into Integrated Circuits (Extended Abstract)
Approximating Edit Distance in the Fully Dynamic Model
The Finite Capacity Dial-A-Ride Problem
A Note on Tape Bounds for SLA Language Processing
IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015
Modeling Communications Protocols by Automata
Iteratively Realized Sequential Circuits
Random Θ(log n)-CNFs Are Hard for Cutting Planes
Distributive Graph Algorithms-Global Solutions from Local Data
Maximum Matchings in Sparse Random Graphs
Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography
On Taking Roots in Finite Fields
On the Complexity of Finding Narrow Proofs
Distance Oracles beyond the Thorup-Zwick Bound
Reasoning about Functional Programs and Complexity Classes Associated with Type Disciplines
How to Simultaneously Exchange a Secret Bit by Flipping a Symmetrically-Biased Coin
A New Deterministic Algorithm for Dynamic Set Cover
A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Non-negative Weights
A Las Vegas Algorithm for Linear Programming When the Dimension Is Small
Rectangular Kronecker Coefficients and Plethysms in Geometric Complexity Theory
Minimum Weight Cycles and Triangles: Equivalences and Algorithms
Sparsification-A Technique for Speeding up Dynamic Graph Algorithms (Extended Abstract)
A Polynomial Time Algorithm for Lossy Population Recovery
Symmetric Polynomials over Z m and Simultaneous Communication Protocol
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
On n-tape finite state acceptors
Improved Depth Lower Vounds for Small Distance Connectivity
Learning Convex Concepts from Gaussian Distributions with PCA
How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games
ong-lived Adaptive Collect with Applications
HDX Condensers
Computing Integral Points in Convex Semi-algebraic Sets
Towards Secure and Scalable Computation in Peer-to-Peer Networks
Quantum Oracle Interrogation: Getting All Information for Almost Half the Price
Impossibility of Differentially Private Universally Optimal Mechanisms
Random Order Online Set Cover is as Easy as Offline
Languages for Defining Sets in Arbitrary Algebras
Infinite State Probabilistic Transition Tables and Chains Ergodic Properties
Breaking the Cubic Barrier for (Unweighted) Tree Edit Distance
A polylogarithmic approximation of the minimum bisection
Measured Descent: A New Embedding Method for Finite Metrics
44th Symposium on Foundations of Computer Science, FOCS 2003, Cambridge, MA, USA, October 11-14, 2003, Proceedings
On Syntactic versus Computational Views of Approximability
On Approximating Maximum Independent Set of Rectangles
Transforming Men into Mice (Polynomial Algorithm for Genomic Distance Problem)
Lattices, Möbius Functions and Communication Complexity
Fully Online Matching II: Beating Ranking and Water-filling
On connecting modules together uniformly to form a modular computer
Sensitivity Sampling for k-Means: Worst Case and Stability Optimal Coreset Bounds
On Probabilistic Automata with Structural Restrictions
Efficient Information Gathering on the Internet (extended abstract)
On the Completeness of Object-Creating Query Languages (Extended Abstract)
Towards Better Approximation of Graph Crossing Number
Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems (Preliminary Version)
Computational Complexity in Algebraic Function Fields (Preliminary Version)
Dense Subsets of Pseudorandom Sets
Parallel Computations in Graph Theory
Optimizing Static Calendar Queues
Improved Approximation Algorithms for Unsplittable Flow Problems
Flow of Control in the Proof Theory of Structured Programming
Combinatorial PCPs with Efficient Verifiers
A procedure for obtaining an economical asynchronous sequential circuit directly from a set of regular expressions
Parametric Shortest Paths in Planar Graphs
Bounded Time-Stamps (Extended Abstract)
Chasing Positive Bodies
Hiding Among the Clones: A Simple and Nearly Optimal Analysis of Privacy Amplification by Shuffling
Efficient Cryptographic Schemes Provably as Secure as Subset Sum
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l 1
A Note on the Power of Threshold Circuits
Machine Identification Concepts of Path Sensitizing Fault Diagnosis
Incoercible Multiparty Computation (extended abstract)
New Coding Techniques for Improved Bandwidth Utilization
On Four-Connecting a Triconnected Graph (Extended Abstract)
A Quadratic Time Algorithm for The MinMax Length Triangulation (Extended Abstract)
Coordinate Methods for Accelerating ℓ∞ Regression and Faster Approximate Maximum Flow
A Row Assignment for Delay-Free Realizations of Flow Tables without Essential Hazards
Approximate Option Pricing
An On-Line Algorithm for Improving Performance in Navigation
On Learning Mixtures of Well-Separated Gaussians
Channel Routing of Multiterminal Nets
Power from Random Strings
The Power of Reordering for Online Minimum Makespan Scheduling
Output-Sensitive Hidden Surface Removal
First-Order Model Checking on Monadically Stable Graph Classes
All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time
The Competitive Analysis of Risk Taking with Applications to Online Trading
Zero-Knowledge Proofs of Knowledge Without Interaction (Extended Abstract)
Planarity Allowing Few Error Vertices in Linear Time
The Strength of Weak Learnability (Extended Abstract)
Settling the Complexity of Computing Approximate Two-Player Nash Equilibria
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond
A proof concerning infinite nets of logic elements without feedback
Locally Uniform Hashing
Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method
Worst-Case to Average-Case Reductions Based on Gaussian Measures
Exponential Lower Bounds for Finding Brouwer Fixed Points (Extended Abstract)
New Techniques for Proving Fine-Grained Average-Case Hardness
An End-to-End Argument in Mechanism Design (Prior-Independent Auctions for Budgeted Agents)
One-way Functions are Essential for Complexity Based Cryptography (Extended Abstract)
21st Annual Symposium on Foundations of Computer Science, Syracuse, New York, USA, 13-15 October 1980
Rational Secure Computation and Ideal Mechanism Design
An Efficient Algorithm to Find all 'Bidirectional' Edges of an Undirected Graph
Grammars with Macro-Like Productions
Fully Dynamic (1+ e)-Approximate Matchings
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
Boolean matrices applied to sequential circuit theory and threshold logics
Two Source Extractors for Asymptotically Optimal Entropy, and (Many) More
Approximating a Finite Metric by a Small Number of Tree Metrics
The Computational Complexity of Knot and Link Problems
Constructing Small-Bias Sets from Algebraic-Geometric Codes
Postselection threshold against biased noise
Inapproximability for Metric Embeddings into R^d
Undecidability of the Horn-Clause Implication Problem
Algorithmic Barriers from Phase Transitions
Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract)
Inapproximability of Positive Semidefinite Permanents and Quantum State Tomography
Online Matching with General Arrivals
On Hash-Coding Algorithms for Partial-Match Retrieval (Extended Abstract)
Probabilistic Polynomials and Hamming Nearest Neighbors
Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
Building Steiner Trees with Incomplete Global Knowledge
An Improved Exponential-Time Algorithm for k -SAT
Unique Decoding of Explicit $\varepsilon$-balanced Codes Near the Gilbert-Varshamov Bound
9th Annual Symposium on Switching and Automata Theory, Schenectady, New York, USA, October 15-18, 1968
On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Round
Approximating the Permanent of a Random Matrix with Vanishing Mean
Reporting Points in Halfspaces
A Time-Space Tradeoff for Language Recognition
On the Computational Power of PP and +P
Sampling According to the Multivariate Normal Density
Lower Bounds for Clique vs. Independent Set
Faster SDP Hierarchy Solvers for Local Rounding Algorithms
Using Difficulty of Prediction to Decrease Computation: Fast Sort, Priority Queue and Convex Hull on Entropy Bounded Inputs
Settling the Communication Complexity of Combinatorial Auctions with Two Subadditive Buyers
Computational Complexity of Roots of Real Functions (Extended Abstract)
Polynomial Degree vs. Quantum Query Complexity
Fourier Sparsity, Spectral Norm, and the Log-Rank Conjecture
Near-Linear Time Approximations Schemes for Clustering in Doubling Metrics
Limits on the Efficiency of One-Way Permutation-Based Hash Functions
Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications
Boosting and Hard-Core Sets
Learning a Hidden Matching
A Quantum Query Complexity Trichotomy for Regular Languages
Kakeya Sets, New Mergers and Old Extractors
Some Results on Greedy Embeddings in Metric Spaces
A Faster Interior Point Method for Semidefinite Programming
Trade-Offs between Depth and Width in Parallel Computation (Preliminary Version)
Graph-Grammars: An Algebraic Approach
Deciding First-Order Properties for Sparse Graphs
Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
The 1D Area Law and the Complexity of Quantum States: A Combinatorial Approach
Space Bounds for Graph Connectivity Problems on Node-named JAGs and Node-ordered JAGs
Drawing Planar Graphs Using the lmc-Ordering (Extended Abstract)
Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces
Simple Computation-Universal Cellular Spaces and Self-Reproduction
Online Bipartite Matching in Offline Time
Asymptotically Optimal PRAM Emulation on Faulty Hypercubes (Extended Abstract)
Fourier-Sparse Interpolation without a Frequency Gap
Fully Dynamic Cycle-Equivalence in Graphs
Minimizing Flow Time Nonclairvoyantly
Hardness of Packing, Covering and Partitioning Simple Polygons with Unit Squares
The Complexity of Finding Medians
Universal Test Sets for Logic Networks
Computing the Maximum and the Median
Towards Learning Sparsely Used Dictionaries with Arbitrary Supports
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)
Subsets and Supermajorities: Optimal Hashing-based Set Similarity Search
The Characterization of the Derivation Trees of Context Free Sets of Terms as Regular Sets
Algebras of Feasible Functions
Origins of Recursive Function Theory
A Short List of Equalities Induces Large Sign Rank
Polylogarithmic Approximation for Minimum Planarization (Almost)
Subquadratic Zero-Knowledge
Symbolic determinant identity testing (SDIT) is not a null cone problem; and the symmetries of algebraic varieties
Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees
The Diameter of the Fractional Matching Polytope and Its Hardness Implications
Regular-Like Expressions for Some Irregular Languages
Near Optimal Column-Based Matrix Reconstruction
The Sketching Complexity of Graph and Hypergraph Counting
Algorithms for Single-Source Vertex Connectivity
Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction
Bounded Geometries, Fractals, and Low-Distortion Embeddings
Hierarchical Placement and Network Design Problems
23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 November 1982
Radical Sylvester-Gallai Theorem for Cubics
Strong vs. Weak Range Avoidance and the Linear Ordering Principle
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
Gadgets, Approximation, and Linear Programming (extended abstract)
Estimating the Longest Increasing Sequence in Polylogarithmic Time
A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral Sparsifiers from a few Random Spanning Trees
Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization
Amplification and Derandomization without Slowdown
Almost-Natural Proofs
Approximation Algorithms for some Routing Problems
List-Decoding Using The XOR Lemma
Tight Lipschitz Hardness for optimizing Mean Field Spin Glasses
A Model-Theoretic Analysis of Knowledge: Preliminary Report
Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fan-In
Non-Black-Box Worst-Case to Average-Case Reductions within NP
On Minimum and Maximum Spanning Trees of Linearly Moving Points
Minimum-Cost Network Design with (Dis)economies of Scale
How to Round Any CSP
Factoring with Cyclotomic Polynomials
A Characterization of Two-Way Deterministic Classes of Languages
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
Testing Positive Semidefiniteness Using Linear Measurements
Learning from Outcomes: Evidence-Based Rankings
'Eventual' Is Earlier than 'Immediate'
Fast and Compact Exact Distance Oracle for Planar Graphs
Primality and Identity Testing via Chinese Remaindering
Hölder Homeomorphisms and Approximate Nearest Neighbors
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
Elimination of Static and Dynamic Hazards in Combinatorial Switching Circuits
New Lower Bound Techniques for VLSI
On Delsarte's Linear Programming Bounds for Binary Codes
Regularity Lemmas and Combinatorial Algorithms
Average Case Lower Bounds on the Construction and Searching of Partial Orders
Completely Functional Asynchronous Computational Structures
A Necessary and Sufficient Condition for the Existence of Hoare Logics
Resolution of the Burrows-Wheeler Transform Conjecture
Fairness Measures for Resource Allocation
Pattern Matching with Swaps
The Regularity Lemma and Approximation Schemes for Dense Problems
Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs
Inverse Problems in Coding, Automata, and Continuous Systems
Local Computation Algorithms for Maximum Matching: New Lower Bounds
Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues
A 3-Approximation for the Minimum Tree Spanning k Vertices
Efficient Volume Sampling for Row/Column Subset Selection
Universal Data Compression and Portfolio Selection
On the Combinatorial and Algebraic Complexity of Quantifier Elimination
The Multiparty Communication Complexity of Interleaved Group Products
Succinct Arguments for QMA from Standard Assumptions via Compiled Nonlocal Games
Local Proofs Approaching the Witness Length [Extended Abstract]
Towards an Optimal Bit-Reversal Permutation Program
A Strong Separation for Adversarially Robust ℓ0 Estimation for Linear Sketches
On Boolean Functions Having Maximal Number of Subfunction Classes
The Value of Knowing a Demand Curve: Bounds on Regret for Online Posted-Price Auctions
List Decodable Mean Estimation in Nearly Linear Time
Learning an Intersection of k Halfspaces over a Uniform Distribution
Simple Routing Strategies for Adversarial Systems
20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 29-31 October 1979
On the Exact Complexity of String Matching (Extended Abstract)
Improved Two-Source Extractors, and Affine Extractors for Polylogarithmic Entropy
Agnostically Learning Halfspaces
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
Complexity of Recognition in Intermediate-Level Languages
A Nearly Optimal Lower Bound on the Approximate Degree of AC 0
A Polynomial Time Algorithm for Optimal Routing around a Rectangle (Extended Abstract)
Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time
The Common Fragment of CTL and LTL
Improved Distance (Sensitivity) Oracles with Subquadratic Space
Optimizing Conjunctive Queries When Attribute Domains Are not Disjoint (Extended Abstract)
On the Design of Easily Testable Sequential Machines
The 3-XORSAT Threshold
Tight Bounds for Classical Open Addressing
Agnostic Learning of Monomials by Halfspaces Is Hard
How to Simulate Random Oracles with Auxiliary Input
A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
Learning Topic Models - Going beyond SVD
3rd Annual Symposium on Switching Circuit Theory and Logical Design, Chicago, Illinois, USA, October 7-12, 1962
Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract)
Spectral Guarantees for Adversarial Streaming PCA
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
Lipschitz Extensions for Node-Private Graph Statistics and the Generalized Exponential Mechanism
The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable
Lower Bounds on the Complexity of Multidimensional Searching (Extended Abstract)
Fitting Metrics and Ultrametrics with Minimum Disagreements
Program Result-Checking: A Theory of Testing Meets a Test of Theory
Decision Versus Search Problems in Super-Polynomial Time
A Decomposition Theorem and Bounds for Randomized Server Problems
Relativized Cryptography
How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation
Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary)
Blackbox Polynomial Identity Testing for Depth 3 Circuits
Quartic Samples Suffice for Fourier Interpolation
Determinant Maximization via Matroid Intersection Algorithms
Communication on Noisy Channels: A Coding Theorem for Computation
Estimating the Longest Increasing Subsequence in Nearly Optimal Time
Parallel Time O(log N) Acceptance of Deterministic CFLs
A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report)
New Notions and Constructions of Sparsification for Graphs and Hypergraphs
Settling the Complexity of Two-Player Nash Equilibrium
Concurrent Oblivious Transfer
Synthesis of counters with threshold elements
On the Complexity of Timetable and Multi-Commodity Flow Problems
Ramsey partitions and proximity data structures
Sublogarithmic Searching without Multiplications
Computing the Tutte Polynomial in Vertex-Exponential Time
Fault Tolerant Sorting Network
The Hardest Explicit Construction
Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring
Polynomial Algorithm for the k-Cut Problem
The Asymptotic Complexity of Merging Networks
Clustering Motion
A Fast Probabilistic Parallel Sorting Algorithm
Super-linear time-space tradeoff lower bounds for randomized computation
The Randomness Recycler: A New Technique for Perfect Sampling
New Extension of the Weil Bound for Character Sums with Applications to Coding
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus
Outsourcing Private RAM Computation
Global Information from Local Observation
Approximate String Matching in Sublinear Expected Time
Optimal Bounds for Quantum Bit Commitment
Algorithms for Matrix Groups and the Tits Alternative
Proving Hard-Core Predicates Using List Decoding
On the Hardness of Signaling
Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version)
A Characterization of Graph Properties Testable for General Planar Graphs with one-Sided Error (It's all About Forbidden Subgraphs)
Efficient Truncated Statistics with Unknown Truncation
Fast Unimodular Reduction: Planar Integer Lattices (Extended Abstract)
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP
New NP-Hard and NP-Complete Polynomial and Integer Divisibility Problems
Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes
Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality
Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries
Thin Trees for Laminar Families
Faster Pattern Matching under Edit Distance : A Reduction to Dynamic Puzzle Matching and the Seaweed Monoid of Permutation Matrices
FFD Bin Packing for Item Sizes with Distributions on [0,1/2]
Edge-Connectivity Augmentation Preserving Simplicity
Separating the Communication Complexities of MOD m and MOD p Circuits
Testing for Faults in Combinational Cellular Logic Arrays
Randomized Allocation Processes
Small-space and streaming pattern matching with $k$ edits
Boosting Uniformity in Quasirandom Groups: Fast and Simple
A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions
A New Algorithm for the Maximal Flow Problem
Sampling-based Approximation Algorithms for Multi-stage Stochastic
Newton's Method for Fractional Combinatorial Optimization
Deterministic Min-cut in Poly-logarithmic Max-flows
33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, October 24-27, 1992