yusuke1997/dblp-id-title huggingface dataset:
Improved Time Bounds for the Maximum Flow Problem
Efficient Simulations Among Several Models of Parallel Computers
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
Erratum: A Full Dichotomy for \(\textsf{Holant}^\mathbf{c}\), Inspired by Quantum Computation
The Complexity of the Lin-Kernighan Heuristic for the Traveling Salesman Problem
Counting Complexity Classes for Numeric Computations I: Semilinear Sets
Nonindependent Randomized Rounding and an Application to Digital Halftoning
Special Issue On The Thirty-Eighth Annual ACM Symposium On Theory Of Computing (STOC 2006)
Processor-Shared Time-Sharing Models in Heavy Traffic
Three-Processor Tasks Are Undecidable
The Specialization of Programs by Theorem Proving
Generating t-ary Trees Lexicographically
An Efficient Data Structure for Lattice Operations
A Heuristic Algorithm for Small Separators in Arbitrary Graphs
Isomorphism Testing for Graphs, Semigroups, and Finite Automata Are Polynomially Equivalent Problems
3-Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations
Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks
Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees
Multicommodity Flows and Cuts in Polymatroidal Networks
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching
$O(\log^2{k}/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial Time Algorithm
On the Axiomatization of "If-Then-Else"
Approximation Algorithms for the 0-Extension Problem
An Optimal Execution Time Estimate of Static Versus Dynamic Allocation in Multiprocessor Systems
On the Number of Additions to Compute Specific Polynomials
Continuous Group Averaging and Pattern Classification Problems
The Computational Complexity of Provability in Systems of Modal Propositional Logic
A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives
Separating the Communication Complexity of Truthful and Nontruthful Algorithms for Combinatorial Auctions
Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?
Dynamic and Nonuniform Pricing Strategies for Revenue Maximization
On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients
Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles
Tight Analyses of Two Local Load Balancing Algorithms
A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
Varieties of Iteration Theories
An Optimal Separation of Randomized and Quantum Query Complexity
Equivalence Relations, Invariants, and Normal Forms
Attribute Grammars and Mathematical Semantics
Eigenvectors of Orthogonally Decomposable Functions
The Average-Case Complexity of Counting Cliques in Erdös-Rényi Hypergraphs
Dynamic Sampling from Graphical Models
Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid
Constant Rank Two-Player Games are PPAD-hard
Fully Dynamic Point Location in a Monotone Subdivision
A Note on the Intersection of Complexity Classes of Functions
A Sublinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
On Relating Time and Space to Size and Depth
Curvature-Constrained Shortest Paths in a Convex Polygon
Balanced Allocation: Patience Is Not a Virtue
The Distributed Firing Squad Problem
Integration in Finite Terms with Special Functions: The Logarithmic Integral
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
Faster Algorithms for Minimum Cycle Basis in Directed Graphs
Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees
Optimal Stochastic Allocation of Machines Under Waiting-Time Constraints
Polynomial Space Counting Problems
Constructive, Deterministic Implementation of Shared Memory on Meshes
An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection
Nonuniform Discretization for Kinodynamic Motion Planning and its Applications
Online Node-weighted Steiner Forest and Extensions via Disk Paintings
The Power of Migration in Multiprocessor Scheduling of Real-Time Systems
Reset Sequences for Monotonic Automata
Isomorph Rejection on Power Sets
Fair Simulation Relations, Parity Games, and State Space Reduction for Bu"chi Automata
Known Algorithms for Edge Clique Cover are Probably Optimal
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
Ray Shooting Amidst Spheres in Three Dimensions and Related Problems
Distributional Word Problem for Groups
Computing Maximally Separated Sets in the Plane
Quantum Formulas: A Lower Bound and Simulation
Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
Self-Improving Algorithms for Coordinatewise Maxima and Convex Hulls
On Multiplication of Polynomials Modulo a Polynomial
Special Section on The Sixty-Third Annual IEEE Symposium on Foundations of Computer Science (2022)
Special Section on the Fifty-Eighth Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017)
Approximation Algorithms for Scheduling Parallel Jobs
A Density Theorem for Purely Iterative Zero Finding Methods
Approximation Algorithms for Several Graph Augmentation Problems
Quantum Computation and the Evaluation of Tensor Networks
Optimal Alphabetic Trees
Computational Complexity of Sparse Rational Interpolation
Quantum Property Testing
On the Succinctness of Different Representations of Languages
Linear Programming with Two Variables per Inequality in Poly-Log Time
Random Graph Isomorphism
Mitotic Classes in Inductive Inference
Padded Lists Revisited
Weighted Leaf AVL-Trees
An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance
On the Power of Logic Resynthesis
The Working Set Size Distribution for the Markov Chain Model of Program Behavior
When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem?
Balanced Allocations
Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
Probabilistic Parallel Algorithms for Sorting and Selection
Nearly Optimal Algorithms for Canonical Matrix Forms
Explicit Near-Ramanujan Graphs of Every Degree
Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete
Dynamic Bin Packing
An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network
Interior Point Methods Are Not Worse than Simplex
Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses
Resolution Is Not Automatizable Unless W[P] Is Tractable
Reconstructing Chromosomal Evolution
Optimal Broadcast with Partial Knowledge
Inapproximability of Truthful Mechanisms via Generalizations of the Vapnik-Chervonenkis Dimension
Analysis of the Optimal, Look-Ahead Demand Paging Algorithms
On Universal Classes of Extremely Random Constant-Time Hash Functions
Total Coloring With Delta + (log Delta) Colors
Privacy Amplification by Public Discussion
Top-Down Analysis of Path Compression
A Near-Optimal Separation of Regular and General Resolution
Precise Analyses of the Right- and Left-Shift Greatest Common Divisor Algorithms for GF(q)[x]
Sums of Divisors, Perfect Numbers and Factoring
Construction of Optimal alpha-beta Leaf Trees with Applications to Prefix Code and Information Retrieval
Upward Planar Drawing of Single-Source Acyclic Digraphs
Strictly Nonblocking Multirate log d ( N, m, p ) Networks
A Pseudorandom Generator from any One-way Function
A Partial Analysis of Height-Balanced Trees Under Random Insertions and Deletions
Near-Optimal Solutions to a 2-Dimensional Placement Problem
New Algorithms for Polynomial Multiplication
Divide and Conquer Heuristics for Minimum Weighted Euclidean Matching
Very Simple Methods for All Pairs Network Flow Analysis
Recognizing Well-Parenthesized Expressions in the Streaming Model
Noncommutative Bilinear Algorithms for 3 x 3 Matrix Multiplication
Caching with Time Windows and Delays
A Fast Parallel Algorithm for Determining all Roots of a Polynomial with Real Roots
Fixed-Parameter Tractability and Completeness I: Basic Results
Performance of Johnson-Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering
Black-Box Concurrent Zero-Knowledge Requires (Almost) Logarithmically Many Rounds
Random Hyperplane Search Trees
On the Evaluation of Powers
Correction: Parallel Merge Sort
Reversal-Bounded Acceptors and Intersections of Linear Languages
Negation is Powerless for Boolean Slice Functions
An Optimal Algorithm for Checking Regularity
An Output-Sensitive Algorithm for Computing Visibility Graphs
Tight Lower Bounds for st-Connectivity on the NNJAG Model
Searching for Sorted Sequences of Kings in Tournaments
Computing components and projections of curves over finite fields
Nonlocal Games with Noisy Maximally Entangled States are Decidable
Solvability in Asynchronous Environments II: Finite Interactive Tasks
Computing Two-Dimensional Integer Hulls
A Stochastic Checkpoint Optimization Problem
On the Computational Complexity of Algebra on Lattices
Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
Limitations on Explicit Constructions of Expanding Graphs
A Queueing Analysis of Hashing with Lazy Deletion
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
Postorder Disjoint Set Union is Linear
Distributed Selfish Load Balancing
Randomized Parallel Algorithms for Matroid Union and Intersection, With Applications to Arboresences and Edge-Disjoint Spanning Trees
Sparse Sets, Lowness and Highness
Polynomial Time Productivity, Approximations, and Levelability
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
The Global Power of Additional Queries to P-Random Oracles
Special Section on the Fifty-First Annual ACM Sympositum on the Theory of Computing (STOC 2019)
Binary Space Partitions for Axis-Aligned Fat Rectangles
Minimum Congestion Mapping in a Cloud
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$
Vertical Ray Shooting and Computing Depth Orders for Fat Objects
A Note on Bottom-Up Skew Heaps
The 3-Colorability Problem on Graphs with Maximum Degree Four
Fault-Tolerant Quantum Computation with Constant Error Rate
Bounded Query Classes
Optimal and Near-Optimal Scheduling Algorithms for Batched Processing in Linear Storage
Diameter, Eccentricities and Distance Oracle Computations on H -Minor Free Graphs and Graphs of Bounded (Distance) Vapnik-Chervonenkis Dimension
Semantic Correctness for a Parallel Object-Oriented Language
Mondshein Sequences (a.k.a. (2, 1)-Orders)
The Combinatorial Structure of Wait-Free Solvable Tasks
A Note on Perfect Elimination Digraphs
Reducing Multiple Object Motion Planning to Graph Searching
Motion Planning of Legged Robots
Approximate Modularity Revisited
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
Multiwriter Consistency Conditions for Shared Memory Registers
Navigating in Unfamiliar Geometric Terrain
Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms
Recognizing P_4 Sparse Graphs in Linear Time
General Results on Tour Lengths in Machines and Digraphs
A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph
Special Section on the Fifty-First Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010)
The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems
Maintaining Minimum Spanning Forests in Dynamic Graphs
Boolean Functions, Invariance Groups, and Parallel Complexity
Strict Cost Sharing Schemes for Steiner Forest
New Fast Algorithms for Matrix Operations
Proportion Extend Sort
Different Modes of Communication
Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
Random Sampling, Halfspace Range Reporting, and Construction of (<= k)-Levels in Three Dimensions
An Optimal Algorithm for Monte Carlo Estimation
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions
On Deterministic Multi-Pass Analysis
An Efficient Cycle Vector Space Algorithm for Listing all Cycles of a Planar Graph
Insertion and Compaction Algorithms in Sequentially Allocated Storage
Node-Deletion NP-Complete Problems
Distances and Finger Search in Random Binary Search Trees
Erratum: The Polynomial Time Hierarchy Collapses if the Boolean Hierarchy Collapses
Optimal Termination Protocols for Network Partitioning
Absolute Factorization of Polynomials: A Geometric Approach
Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion
Addition Machines
A Note on Spira's Algorithm for the All-Pairs Shortest-Path Problem
On the Loop Switching Addressing Problem
Simple Fast Parallel Hashing by Oblivious Execution
A Hierarchy Theorem for Polynomial-Space Recognition
Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations
Rudimentary Predicates and Relative Computation
A Lower Bound on the Complexity of the Union-Split-Find Problem
Sorting and Selecting in Rounds
Compaction, Retraction, and Constraint Satisfaction
Kolmogorov Random Graphs and the Incompressibility Method
Subexponential Parameterized Algorithm for Minimum Fill-In
On the Maximum Scatter Traveling Salesperson Problem
Rearrangeability of (2n-1)-Stage Shuffle-Exchange Networks
An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
Special Section On Foundations of Computer Science
Faster All-Pairs Shortest Paths via Circuit Complexity
A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time
Improved Constant-Time Approximation Algorithms for Maximum Matchings and Other Optimization Problems
Cylindrical Algebraic Decomposition I: The Basic Algorithm
Tighter Bounds for the Multifit Processor Scheduling Algorithm
Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem
On Competitive Group Testing
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
On the Expected Sublinearity of the Boyer-Moore Algorithm
Trade-Offs Between Depth and Width in Parallel Computation
Complexity of Matroid Property Algorithms
Pseudorandom Functions and Factoring
Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems
A Polylogarithmic Approximation of the Minimum Bisection
Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
The Ultimate Planar Convex Hull Algorithm?
Beating the Integrality Ratio for $s$-$t$-Tours in Graphs
Time-Space Lower Bounds for Directed st-Connectivity on Graph Automata Models
Testing Membership in Languages that Have Small Width Branching Programs
Random Formulas Have Frozen Variables
Graphs that are Almost Binary Trees
An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching
An $O(\log \log m)$ Prophet Inequality for Subadditive Combinatorial Auctions
Horn Extensions of a Partially Defined Boolean Function
Finding, Minimizing, and Counting Weighted Subgraphs
Nondeterministic Quasi-Polynomial Time is Average-Case Hard for \(\textsf{ACC}\) Circuits
A 3/2-Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
On Rational Number Reconstruction and Approximation
Feasible Real Functions and Arithmetic Circuits
A Polynomial Lower Bound for Testing Monotonicity
Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
Shadow Tomography of Quantum States
Stackelberg Scheduling Strategies
Output-Sensitive Construction of the Union of Triangles
An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem
Constant Time Generation of Free Trees
Improved Data Structures for Fully Dynamic Biconnectivity
Approximation Techniques for Utilitarian Mechanism Design
A Provably Good Algorithm for the Two Module Routing Problem
The Renewal Model for Program Behavior
List Organizing Strategies Using Stochastic Move-to-Front and Stochastic Move-to-Rear Operations
A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
Hardness of the Undirected Congestion Minimization Problem
Exact Learning of Discretized Geometric Concepts
The Complexity of Early Deciding Set Agreement
Real-Time Strict Deterministic Languages
Infix to Prefix Translation: The Insufficiency of a Pushdown Stack
The Complete Convergence of Best Fit Decreasing
Multidimensional Sorting
Algorithmic Polynomials
On the Complexity of the Model Checking Problem
Sherali-Adams Relaxations and Indistinguishability in Counting Logics
On the Optimal Layout of Planar Graphs with Fixed Boundary
Approximating the Domatic Number
Deterministic Massively Parallel Connectivity
Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
A Lower Bound on the Complexity of Division in Finite Extension Fields and Inversion in Quadratic Alternative Algebras
Parallel Complexity of the Connected Subgraph Problem
The Potential of the Approximation Method
Agreement Tests on Graphs and Hypergraphs
Three-Dimensional Circuit Layouts
Lower Bounds for Randomized Mutual Exclusion
Tensor Rank and Border Rank of Band Toeplitz Matrices
Equilibria of Greedy Combinatorial Auctions
Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables
Exegesis of Self-Organizing Linear Search
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
Two-Dimensional Periodicity in Rectangular Arrays
The Complexity of Counting Stable Marriages
On k-Hulls and Related Problems
Near-Optimal Distributed Maximum Flow
Algorithms for Data Migration with Cloning
On the Complexity of Some Common Geometric Location Problems
Finding Paths and Cycles of Superpolylogarithmic Length
Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control
Integer Linear Programs and Local Search for Max-Cut
A Grammar-Based Approach Towards Unifying Hierarchical Data Models
On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy
There are No Sparse NP w -Hard Sets
Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
Tight Revenue Gaps among Multiunit Mechanisms
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
Automatic Nonzero Structure Analysis
Special Issue on Foundations of Computer Science
Generalized Selection and Ranking: Sorted Matrices
Algorithms for a Minimum Volume Enclosing Simplex in Three Dimensions
The Geometry of Differential Privacy: The Small Database and Approximate Cases
Minimization of Rational Word Functions
The Fast Johnson--Lindenstrauss Transform and Approximate Nearest Neighbors
Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
Complexities for Generalized Models of Self-Assembly
On the Complexity of Maintaining Partial Sums
Planar Depth-First Search in O(log n) Parallel Time
A Complete Dichotomy Rises from the Capture of Vanishing Signatures
On Learning Read-k-Satisfy-j DNF
Hamilton Paths in Grid Graphs
Bisimulation Metrics for Continuous Markov Decision Processes
Reachability and Distance Queries via 2-Hop Labels
Every Monotone Graph Property Is Testable
Tabulation-Based 5-Independent Hashing with Applications to Linear Probing and Second Moment Estimation
A Lambda Calculus for Quantum Computation
Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
An Efficient Method for Storing Ancestor Information in Trees
All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
On Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets
Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields
A Note on the Homotopy Type of Wait-Free Atomic Snapshot Protocol Complexes
On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
The Traveling Salesman Problem with Many Visits to Few Cities
Corrigendum: Soundness and Completeness of an Axiom System for Program Verification
On Worst-Case Robin Hood Hashing
Interdomain Routing and Games
The Computational Complexity to Evaluate Representations of General Linear Groups
Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem
Max Cut and the Smallest Eigenvalue
Analysis of a General Mass Storage System
Determinism vs. Nondeterminism in Multiparty Communication Complexity
Online and Stochastic Survivable Network Design
Varieties of "if-then-else"
Introduction to Special Section on Quantum Computation
A Size-Popularity Tradeoff in the Stable Marriage Problem
Space-Efficient Deterministic Simulation of Probabilistic Automata
A c k n 5-Approximation Algorithm for Treewidth
Implementation Correctness Involving a Language with goto Statements
Randomized Competitive Algorithms for Generalized Caching
Approximate Sparse Recovery: Optimizing Time and Measurements
Monotone Circuits for Connectivity Have Depth (log n ) 2- o (1)
Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata
An o(n³)-Time Algorithm Maximum-Flow Algorithm
Proof Theory of Partial Correctness Verification Systems
Nice Labeling Problem for Event Structures: A Counterexample
The Shrinkage Exponent of de Morgan Formulas is 2
A Natural NP-Complete Problem with a Nontrivial Lower Nound
Approximating Edit Distance in Near-Linear Time
Quantum Algorithms for Some Hidden Shift Problems
Ordered and Unordered Tree Inclusion
Special Section on the Fifty-Ninth Annual IEEE Symposium on Foundations of Computer Science (2018)
Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates
Nonmalleable Cryptography
An Omega(sqrt{log log n}) Lower Bound for Routing in Optical Networks
On Achieving the "Best of Both Worlds" in Secure Multiparty Computation
Treewidth and Minimum Fill-in: Grouping the Minimal Separators
A Characterization of Universal Stability in the Adversarial Queuing Model
Circuit Bottom Fan-In and Computational Power
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut
The Enumeration of Maximal Cliques of Large Graphs
A Model for Asynchronous Shared Memory Parallel Computation
Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy
Collusion Resistant Traitor Tracing from Learning with Errors
On Approximating Matrix Norms in Data Streams
Minimum-Knowledge Interactive Proofs for Decision Problems
Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter
A Depth-Universal Circuit
A DNF without Regular Shortest Consensus Path
Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)
The Complexity of Counting in Sparse, Regular, and Planar Graphs
Learning Mixtures of Product Distributions over Discrete Domains
Machine Selection of Elements in Crossword Puzzles: An Application of Computational Linguistics
On the Amount of Nondeterminism and the Power of Verifying
Optimal Multi-Way Search Trees
On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph
On Edge Coloring Bipartite Graphs
Computation of Matrix Chain Products. Part I
Parallel Quantum Computation and Quantum Codes
Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication
Designing a Uniform Random Number Generator Whose Subsequences are k-Distributed
Implementation and Analysis of Binomial Queue Algorithms
Binary Space Partitions for Line Segments with a Limited Number of Directions
Ranking Algorithms for Lists of Partitions
A Sublinear Space, Polynomial Time Algorithm for Directed s - t Connectivity
A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product
On the Complexity of Polynomial Zeros
Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle