yusuke1997/dblp-id-title huggingface dataset:
Optimal Reductions of Two-Terminal Directed Acyclic Graphs
Laying out Graphs Using Queues
A Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets
Extending Downward Collapse from 1-versus-2 Queries to m-versus-m + 1 Queries
An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling
Additive Approximation for Bounded Degree Survivable Network Design
The Number of 1's in Binary Integers: Bounds and Extremal Properties
A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes
The Effects of Temporary Sessions on Network Performance
(1+epsilon, beta)-Spanner Constructions for General Graphs
Time-Adaptive Algorithms for Synchronization
Partial Match Queries in Random k -d Trees
Tile Complexity of Linear Assemblies
O(sqrt(log(n)) Approximation to SPARSEST CUT in Õ(n 2 ) Time
Learning Random Log-Depth Decision Trees under Uniform Distribution
Optimal Clock Synchronization under Different Delay Assumptions
First-Order Languages Expressing Constructible Spatial Database Queries
An APTAS for Generalized Cost Variable-Sized Bin Packing
Symbolic Vector and Dyadic Analysis
Approximate Nearest Neighbor Search for Low-Dimensional Queries
Lower Bounds for Geometrical and Physical Problems
Perfect L p Sampling in a Data Stream
Lower Bounds for Lucas Chains
Special Section on the Forty-Seventh Annual ACM Symposium on Theory of Computing (STOC 2015)
Reducing Path TSP to TSP
Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions
Asymptotic Expansions of Moments of the Waiting Time in a Shared-Processor of an Interactive System
The Complexity of File Transfer Scheduling with Forwarding
Pushdown Permuter Characterization Theorem
On Fixed-Points of Multivalued Functions on Complete Lattices and Their Application to Generalized Logic Programs
Optimal Search in Planar Subdivisions
Fully Dynamic Maximal Matching in O(log n) Update Time
Immunity, Relativizations, and Nondeterminism
Separator-Based Sparsification II: Edge and Vertex Connectivity
Decidable and Undecidable Problems about Quantum Automata
Improved List-Decodability and List-Recoverability of Reed-Solomon Codes via Tree Packings
The Nilpotency Problem of One-Dimensional Cellular Automata
PTAS for Minimum Cost MultiCovering with Disks
Pseudorandom Generators with Long Stretch and Low Locality from Random Local One-Way Functions
Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
New Bounds for Variable-Sized Online Bin Packing
Simple Local Search Problems That are Hard to Solve
On the Value of Coordination in Network Design
A Constant-Factor Approximation Algorithm for Unsplittable Flow on Paths
Approximation of the Consecutive Ones Matrix Augmentation Problem
An Analysis of a Good Algorithm for the Subtree Problem, Corrected
Finding k Cuts within Twice the Optimal
Sparse Algebraic Equations over Finite Fields
Ranking on Arbitrary Graphs: Rematch via Continuous Linear Programming
Designing Network Protocols for Good Equilibria
Two Algorithms for Generating Weighted Spanning Trees in Order
An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colorings
Sparse Sets in NP - P: Relativizations
Approximation Algorithms for Some Routing Problems
Fast Algorithms for Partial Fraction Decomposition
One Step Transformation of Periodic Sequences by Cellular Automata
Special Section on the Sixty-First Annual IEEE Symposium on Foundations of Computer Science (2020)
Fault Tolerant Spanners for General Graphs
Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
Optimal Bin Packing with Items of Random Sizes III
A Fast Monte-Carlo Test for Primality
Sorting and Selection in Posets
Special Section on the Forty-Ninth Annual ACM Symposium on the Theory of Computing (STOC 2017)
An Application of Duality to Edge-Deletion Problems
Formulas versus Circuits for Small Distance Connectivity
On Good E0L Forms
An Inhomogeneity in the Structure of Karp Degrees
On Spanners and Lightweight Spanners of Geometric Graphs
Robust Positioning Patterns with Low Redundancy
Value Sets of Some Polynomials Over Finite Fields GF(2 2m )
A More Efficient Approximation Scheme for Tree Alignment
Lower-Stretch Spanning Trees
Pumping Lemmas for Regular Sets
Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima
Speed of Recognition of Context-Free Languages by Array Automata
Composing Functions to Minimize Image Size
Bounds on the Costs of Multivalued Register Implementations
Polynomial Root-Finding Algorithms and Branched Covers
Searching in Trees, Series-Parallel and Interval Orders
Digital Search Trees Again Revisited: The Internal Path Length Perspective
Optimal Algorithms for Geometric Centers and Depth
Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs
A Fast Derandomization Scheme and Its Applications
A New Lower Bound Technique and its Application: Tight Lower Bound for a Polygon Triangulation Problem
Solving Simultaneous Modular Equations of Low Degree
Almost Polynomial Factor Hardness for Closest Vector Problem with Preprocessing
A Simple Unpredictable Pseudo-Random Number Generator
An Extension of Computational Duality to Sequences of Bilinear Computations
Fully Dynamic Algorithms for 2-Edge Connectivity
On the Expected Performance of Scanning Disks
NP -Hardness of Approximately Solving Linear Equations over Reals
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Computational Complexity over Finite Fields
Efficient Colored Orthogonal Range Counting
Perfectness is an Elusive Graph Property
A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields
Existence, Uniqueness, and Construction of Rewrite Systems
The Dynamic Parallel Complexity of Computational Circuits
Scheduling Split Intervals
Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
Polynomials with Rational Coefficients Which are Hard to Compute
Computing the Least Fixed Point of Positive Polynomial Systems
Computing the Weak Components of a Directed Graph
Better Online Algorithms for Scheduling with Machine Cost
Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions
Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness
Special Section on the Forty-Third Annual ACM Symposium on Theory of Computing (STOC 2011)
Performance of Sequential Local Algorithms for the Random NAE-K-SAT Problem
Dynamic Programming Optimization over Random Data: The Scaling Exponent for Near-Optimal Solutions
Lowness for the Class of Schnorr Random Reals
Biased Search Trees
On Backtracking: A Combinatorial Description of the Algorithm
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
Efficient On-Line Construction and Correction of Position Trees
Bounds for Selection
Constant-Query Testability of Assignments to Constraint Satisfaction Problems
A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
State-Splitting for Stochastic Machines
An O(n) Algorithm for Determining the Subregion-Tree Representation of a Rectangular Dissection
Computing Shortest Paths amid Convex Pseudodisks
The Time-Complexity of Local Decision in Distributed Agreement
Improved Approximation Algorithms for the Uncapacitated Facility Location Problem
Unoriented Theta-Maxima in the Plane: Complexity and Algorithms
Quantitative Relativizations of Complexity Classes
Special Section on the Forty-First Annual ACM Symposium on Theory of Computing (STOC 2009)
A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors
Planar Strong Connectivity Helps in Parallel Depth-First Search
Evaluation of Polynomials Using the Structure of the Coefficients
Authenticated Algorithms for Byzantine Agreement
A Polynomial Algorithm for 3-Compatible Coloring and the Stubborn List Partition Problem (The Stubborn Problem Is Stubborn No More)
Eulerian Walks in Graphs
The Depth of All Boolean Functions
Universal Bufferless Packet Switching
Path Systems: Constructions, Solutions and Applications
Automatic Asymptotic and Big-O Calculations Via Computer Algebra
Deciding Properties of Nonregular Programs
Consistency and Serializability in Concurrent Database Systems
Approximation Algorithms for Metric Facility Location Problems
Nonmalleable Extractors and Codes, with Their Many Tampered Extensions
Certifiably Pseudorandom Financial Derivatives
Finding an Even Simple Path in a Directed Planar Graph
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
Universal Security for Randomness Expansion from the Spot-Checking Protocol
Fast Parallel Algorithms for Chordal Graphs
Some Area-Time Tradeoffs for VLSI
On Fault-Tolerant Networks for Sorting
Finding a Maximum Independent Set
New Data Structures for Orthogonal Range Queries
Edge-Deletion Problems
Properties of Finite and Pushdown Transducers
Interval Graphs: Canonical Representations in Logspace
Dimensions of Points in Self-Similar Fractals
The Maximum Partition Matching Problem with Applications
Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues
Playing Games with Approximation Algorithms
A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem
Novel Transformation Techniques Using Q-Heaps with Applications to Computational Geometry
Separating Complexity Classes Using Autoreducibility
Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees
Approximating the Permanent via Nonabelian Determinants
Correcting Counter-Automaton-Recognizable Languages
Classifying the Complexity of Constraints Using Finite Algebras
On Optimal Processor Scheduling for Multiprogramming
Computational Complexity and Knowledge Complexity
A Correctness Condition for High-Performance Multiprocessors
An Algorithm for Determining the Chromatic Number of a Graph
A Fast Algorithm for Optimum Height-Limited Alphabetic Binary Trees
Optimal Point Location in a Monotone Subdivision
LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs
Matrix Padé Fractions and Their Computation
Multiplication of Polynomials over Finite Fields
Applying Coding Theory to Sparse Interpolation
Lattice Embeddings for Abstract Bounded Reducibilities
Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties
A Multi-Terminal Minimum Cut Algorithm for Planar Graphs
Intersecting Line Segments in Parallel with an Output-Sensitive Number of Processors
The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms
Fast, Efficient Parallel Algorithms for Some Graph Problems
The Joint Distribution of Elastic Buckets in Multiway Search Trees
A Generalized Suffix Tree and its (Un)expected Asymptotic Behaviors
Random Access to Grammar-Compressed Strings and Trees
Computational Power in Query Languages
On the Hidden Shifted Power Problem
Graph Transformations for Roundoff Analysis
Unique Extrapolation of Polynomial Recurrences
Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs
Effective Computations on Sliding Windows
All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust
Almost Sure Fault Tolerance in Random Graphs
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
Self-Stabilizing Symmetry Breaking in Constant Space
Adaptive and Efficient Algorithms for Lattice Agreement and Renaming
Solving Equations in the Relational Algebra
Probably Approximate Learning Over Classes of Distributions
Classes of Pebble Games and Complete Problems
Online Primal Dual Meets Online Matching with Stochastic Rewards: Configuration LP to the Rescue
On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
New Results on the Complexity of p-Center Problems
Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM's
Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations
Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations
On the Number of Multiplications/Divisions Evaluating a Polynomial with Auxiliary Functions
Kolmogorov Complexity and Deterministic Context-Free Languages
Complexity of Sentences Over Number Rings
The Signature of a Plane Curve
Weakly Triangulated Comparability Graphs
Distributed Verification and Hardness of Distributed Approximation
Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs
Faithful Representation of a Family of Sets by a Set of Intervals
A Heuristic of Scheduling Parallel Tasks and its Analysis
Computing with Noisy Information
Random Polynomials and Approximate Zeros of Newton's Method
Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems
Realization with Feedback Encoding. I: Analogues of the Classical Theory
On the Limit Sets of Cellular Automata
Graph Minimal Uncolorability is D^P-Complete
A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
Boltzmann Samplers, Pólya Theory, and Cycle Pointing
Set Covering with Our Eyes Closed
Compression of Low Entropy Strings with Lempel-Ziv Algorithms
Local List-Decoding and Testing of Random Linear Codes from High Error
A Lower Bound on the Size of Shellsort Sorting Networks
Operator Precedence Grammars and the Noncounting Property
A Lubricant for Data Flow Analysis
Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
Minimum Cuts and Sparsification in Hypergraphs
The Complexity of Computing the Sign of the Tutte Polynomial
Stack and Queue Layouts of Directed Acyclic Graphs: Part I
Set Partitioning via Inclusion-Exclusion
On-Line Scheduling of Imprecise Computations to Minimize Error
Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model
Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics
On Multidimensional Packing Problems
Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts
An Account of Self-Organizing Systems
The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
Structure Versus Hardness Through the Obfuscation Lens
Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming
The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set
A Convergence Theorem for Hierarchies of Model Neurones
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
Average Profile of the Generalized Digital Search Tree and the Generalized Lempel-Ziv Algorithm
Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
Locality, Communication, and Interconnect Length in Multicomputers
On-Line Algorithms for Path Selection in a Nonblocking Network
Low-Density Parity-Check Codes Achieve List-Decoding Capacity
Minimizing Schedule Length Subject to Minimum Flow Time
Toward Tight Approximation Bounds for Graph Diameter and Eccentricities
Errata: On the Number of Multiplications Required for Matrix Multiplication
Voting with Limited Information and Many Alternatives
Space-Efficient Scheduling of Multithreaded Computations
The Formula Isomorphism Problem
Markov Paging
Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
On the List and Bounded Distance Decodability of Reed-Solomon Codes
Oracles that Compute Values
Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring
Inapproximability of the Independent Set Polynomial in the Complex Plane
A Counterexample to Reingold's Pushdown Permuter Characterization Theorem
Group Action Graphs and Parallel Architectures
Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All \({\ell_{{p}}}\) Norms
Computation of Matrix Chain Products. Part II
The Time Measure of One-Tape Turing Machines Does Not Have the Parallel Computation Property
A Fast Algorithm for Optimally Increasing the Edge Connectivity
The Planar Hamiltonian Circuit Problem is NP-Complete
A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimensions
Priority Networks of Communicating Finite State Machines
Interleaved Group Products
List Decoding Tensor Products and Interleaved Codes
Communication Complexity of Simultaneous Messages
Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm
Universally Utility-maximizing Privacy Mechanisms
On-Line Load Balancing in a Hierarchical Server Topology
Twice-Ramanujan Sparsifiers
Semantic Acyclicity on Graph Databases
Data Movement Techniques for the Pyramid Computer
Finding Points on Curves over Finite Fields
Computing Correlation between Piecewise-Linear Functions
Threshold Phenomena in k-Dominant Skylines of Random Samples
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model
Span Programs are Equivalent to Quantum Query Algorithms
Compression in Finite Fields and Torus-Based Cryptography
On the Complexity of Computing the Volume of a Polyhedron
Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier-Manin Operator
The Extended Low Hierarchy is an Infinite Hierarchy
Erratum: On Restricting the Size of Oracles Compared with Restricting Access to Oracles
Strong Spatial Mixing with Fewer Colors for Lattice Graphs
Determining the Chromatic Number of a Graph
The Approximability of Constraint Satisfaction Problems
Efficient Dynamic Traitor Tracing
Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves
A Note on the Hecht-Ullman Characterization of Nonreducible Flow Graphs
The Travelling Salesman Problem and Minimum Matching in the Unit Square
Some Geometry for General River Routing
Terminal Context in Context-Sensitive Grammars
Lower Bounds in a Parallel Model without Bit Operations
Left-to-Right Multiplication for Monotone Boolean Dualization
Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems
Determining the Stability Number of a Graph
Nonnegative Weighted #CSP: An Effective Complexity Dichotomy
The Nonstochastic Multiarmed Bandit Problem
Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with 2 (log n) Ømega(1) Colors
Pass-Efficient Algorithms for Learning Mixtures of Uniform Distributions
Efficient Algorithms for Reconstructing Zero-Recombinant Haplotypes on a Pedigree Based on Fast Elimination of Redundant Linear Equations
Register Allocation for Unary-Binary Trees
A Generalization of the Suffix Tree to Square Matrices, with Applications
Simulation of Parallel Random Access Machines by Circuits
Determinant-Preserving Sparsification of SDDM Matrices
Word Problems and Membership Problems on Compressed Words
Polynomial-Time Recognition of 2-Monotonic Positive Boolean Functions Given by an Oracle
Counting Hypergraph Colorings in the Local Lemma Regime
Parallel Repetition in Projection Games and a Concentration Bound
Some Observations on Separating Complexity Classes
Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization
A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
On the Number of Multiplications Required for Matrix Multiplication
Planar Multicommodity Flows, Maximum Matchings and Negative Cycles
Pattern Formation by Oblivious Asynchronous Mobile Robots
A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
Tight Upper and Lower Bounds on the Path Length of Binary Trees
Distributed (Delta+1)-Coloring in Linear (in Delta) Time
Approximately Counting Hamilton Paths and Cycles in Dense Graphs
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Generating Random Unlabelled Graphs
Local List Recovery of High-Rate Tensor Codes and Applications
Lowness Properties of Sets in the Exponential-Time Hierarchy
A Model and Proof Technique for Message-Based Systems
Testing Probability Distributions using Conditional Samples
A T=O(2 n/2 ), S=O(2 n/4 ) Algorithm for Certain NP-Complete Problems
Matrix Transformation Is Complete for the Average Case
The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich
The Approximate Degree of DNF and CNF Formulas
Fine Separation of Average-Time Complexity Classes
Boolean Circuits, Tensor Ranks, and Communication Complexity
Adaptive Local Ratio
ASPACE(o(log log n)) is Regular
Special Section on the Forty-Second Annual ACM Symposium on Theory of Computing (STOC 2010)
Quantum Complexity Theory
Efficient Message Routing in Planar Networks
Optimum Communication Spanning Trees in Series-Parallel Networks
Breaking the Minsky-Papert Barrier for Constant-Depth Circuits
Low Redundancy in Static Dictionaries with Constant Query Time
Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders
Compatibility and Complexity of Refinements of the Resolution Principle
Preserving Proximity in Arrays
Constant Depth Reducibility
Polynomial-Time Approximation Algorithms for the Ising Model
Approximating k -node Connected Subgraphs via Critical Graphs
The Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees
On Languages Reducible to Algorithmically Random Languages
Addition Chain Methods for the Evaluation of Specific Polynomials
On Nonblocking Multirate Interconnection Networks
Modifications of Competitive Group Testing
A 2EXPTIME Complete Varietal Membership Problem
Faster Space-Efficient Algorithms for Subset Sum, k-Sum, and Related Problems
Simplicity, Relativizations and Nondeterminism
The Inverses of Block Hankel and Block Toeplitz Matrices
An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to VP≠VNP
Special Section on the Fifty-Fifth Annual ACM Symposium on Foundations of Coomputer Science (FOCS 2014)
Omega(n log n) Lower Bounds on Length of Boolean Formulas
Noninteractive Zero-Knowledge
An NC Algorithm for Evaluating Monotone Planar Circuits
Approximating the Stretch Factor of Euclidean Graphs
Recognizing Dart-Free Perfect Graphs
MAX ONES Generalized to Larger Domains
On Parallel Searching
Pattern Matching under Polynomial Transformation
Competitively Chasing Convex Bodies
Stability of Multivalued Continuous Consensus
Quantum Algorithms for the Triangle Problem
Approximation Limitations of Pure Dynamic Programming
On Local Search and Placement of Meters in Networks
On a Conjecture by Coffman, Flatto, and Wright on Stochastic Machine Minimization
Efficient Parallel Algorithms for Testing k-Connectivity and Finding Disjoint s-t Paths in Graphs
On Some Variants of the Bandwidth Minimization Problem
Robustly Solvable Constraint Satisfaction Problems
Lossy Trapdoor Functions and Their Applications
Convex Clusters in a Discrete m-Dimensional Space
Low Distortion Maps Between Point Sets
Erratum: An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon
On Maintaining Dynamic Information in a Concurrent Environment
Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average
Quadratic Algorithms for Minimizing Joins in Restricted Relational Expressions
Decidability of Termination of Grid String Rewriting Rules
Expected-Case Complexity of Approximate Nearest Neighbor Searching