yusuke1997/dblp-id-title huggingface dataset:
Percolation Theory and Computing with Faulty Arrays of Processors
Faster approximation schemes for the two-dimensional knapsack problem
Quantum verification of matrix products
A Capacity Scaling Algorithm for Convex Cost Submodular Flows
Efficient and Robust Persistent Homology for Measures
Approximating the best Nash Equilibrium in n o (log n ) -time breaks the Exponential Time Hypothesis
An optimal dynamic interval stabbing-max data structure?
Improved Rectangular Matrix Multiplication using Powers of the Coppersmith-Winograd Tensor
Chasing Convex Bodies with Linear Competitive Ratio
The Matroid Median Problem
Improved approximating algorithms for Directed Steiner Forest
Optimal Bounds on Private Graph Approximation
Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 5-7 January 1997, New Orleans, Louisiana, USA
Approaching for the s - t -path TSP
Utilitarian Mechanism Design for Multi-Objective Optimization
Network coding: does the model need tuning?
A maiden analysis of Longest Wait First
Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and k -mismatch Matching
A sort of an adversary
Applications of Parametric Searching in Geometric Optimization
Rounds vs queries trade-off in noisy computation
Towards understanding the predictability of stock markets from the perspective of computational complexity
Stochastic coalescence in logarithmic time
Approximation algorithms for grammar-based compression
Compact Redistricting Plans Have Many Spanning Trees
Fréchet-Stable Signatures Using Persistence Homology
Randomized Primal-Dual analysis of RANKING for Online BiPartite Matching
Manhattan Channel Routing with Good Theoretical and Practical Performance
Linear-Time Register Allocation for a Fixed Number of Registers
Improving table compression with combinatorial optimization
Low Rank Matrix-valued Chernoff Bounds and Approximate Matrix Multiplication
Sampling binary contingency tables with a greedy start
Faster approximation algorithms for the minimum latency problem
The Connectivity Threshold for Dense Graphs
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform
Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design
Approaching the Soundness Barrier: A Near Optimal Analysis of the Cube versus Cube Test
Region Growing for Multi-Route Cuts
Fair Scheduling via Iterative Quasi-Uniform Sampling
Fractional packing in ideal clutters
Fast Computation of Output-Sensitive Maxima in a Word RAM
Testing odd-cycle-freeness in Boolean functions
Recognizing Weak Embeddings of Graphs
Polynomial-time approximation schemes for geometric graphs
Stochastic Packing Integer Programs with Few Queries
Superpolynomial lower bounds for decision tree learning and testing
2-Edge Connectivity in Directed Graphs
On Finding Non-Intersecting Paths in Grids and Its Application in Reconfiguring VLSI/WSI Arrays
Shape dimension and approximation from samples
Approximating minimum unsatisfiability of linear equations
Higher Lower Bounds from the 3SUM Conjecture
Almost-Linear Planted Cliques Elude the Metropolis Process
New Approximations for Broadcast Scheduling via Variants of α-point Rounding
Natural Algorithms for Flow Problems
On external memory graph traversal
A near linear time constant factor approximation for Euclidean bichromatic matching (cost)
Exact Analysis of a Priority Queue Algorithm for Random Variate Generation
Combination can be hard: approximability of the unique coverage problem
Flip Dynamics for Sampling Colorings: Improving (11/6 - ε) Using A Simple Metric
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19
Submodular Optimization in the MapReduce Model
Randomized Competitive Algorithms for the List Update Problem
Optimal rate list decoding of folded algebraic-geometric codes over constant-sized alphabets
Authoritative Sources in a Hyperlinked Environment
Estimating Graph Parameters from Random Order Streams
Covering a tree with rooted subtrees - parameterized and approximation algorithms
Distributed broadcast in unknown radio networks
On algorithms for efficient data migration
Equitable colorings extend Chernoff-Hoeffding bounds
Online Submodular Welfare Maximization: Greedy is Optimal
Low-degree Tests
Better Tradeoffs for Exact Distance Oracles in Planar Graphs
Unbreakable Decomposition in Close-to-Linear Time
Cache-oblivious dynamic programming
Balanced Allocations: Caching and Packing, Twinning and Thinning
A Master Theorem for Discrete Divide and Conquer Recurrences
Movement minimization in conveyor flow shop processing
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours
Energy Efficient Scheduling via Partial Shutdown
Improved Deterministic Algorithms for Decremental Transitive Closure and Strongly Connected Components
Doing Two-Level Logic Minimization 100 Times Faster
Efficiently Approximating Edit Distance Between Pseudorandom Strings
Analysis of Ward's Method
Faster kinetic heaps and their use in broadcast scheduling
Approximation schemes for machine scheduling with resource (in-)dependent processing times
A Faster Subquadratic Algorithm for Finding Outlier Correlations
Can the TPRI structure help us to solve the algebraic eigenproblem?
Tight Bounds for ℓp Oblivious Subspace Embeddings
Labeling Schemes for Nearest Common Ancestors through Minor-Universal Trees
Algorithmic strategies in combinatorial chemistry
Fast algorithms for finding proper strategies in game trees
Truly Subcubic Min-Plus Product for Less Structured Matrices, with Applications
Improved Dynamic Dictionary Matching
Near-optimal algorithms for maximum constraint satisfaction problems
Competitive queue management for latency sensitive packets
Finding dominators revisited: extended abstract
Deciding Finiteness of Matrix Groups in Las Vegas Polynomial Time
On the Possibility of Faster SAT Algorithms
New SDP Roundings and Certifiable Approximation for Cubic Optimization
Dynamic Geometric Set Cover, Revisited
Coins make quantum walks faster
Local Search for Max-Sum Diversification
Covering shapes by ellipses
Game theory, algorithms, and the Internet
Spectral recovery of binary censored block models
Efficient algorithms on sets of permutations, dominance, and real-weighted APSP
Near-Optimal Compression for the Planar Graph Metric
Faster two-dimensional pattern matching with k mismatches
Unweighted Layered Graph Traversal: Passing a Crown via Entropy Maximization
Equilibrium Dynamics in Market Games with Exchangeable and Divisible Resources
Mechanism design via consensus estimates, cross checking, and profit extraction
Finding Subsets Maximizing Minimum Structures
Relative-error monotonicity testing
Building a Good Team: Secretary Problems and the Supermodular Degree
Distributed approaches to triangulation and embedding
Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted Proofs
Dimension-independent Sparse Fourier Transform
A New Path from Splay to Dynamic Optimality
Improved recommendation systems
Chaining Multiple-Alignment Fragments in Sub-Quadratic Time
Improved embeddings of graph metrics into random trees
Online Steiner Tree with Deletions
SRPT is 1.86-Competitive for Completion Time Scheduling
Forall-exist statements in pseudopolynomial time
L(2, 1)-labelling of graphs
Asymptotically Fast Triangularization of Matrices Over Rings
Optimal Parallel Sorting in Multi-Level Storage
Testing for Forbidden Order Patterns in an Array
Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs
Robust Voting Rules from Algorithmic Robust Statistics
Computing the Independence Number of Intersection Graphs
End-to-end packet-scheduling in wireless ad-hoc networks
The inverse nearest neighbor problem with astrophysical applications
Which Distribution Distances are Sublinearly Testable?
Counting and Random Generation of Strings in Regular Languages
Dynamic string searching
Tight bounds for worst-case equilibria
Beyond 2-Approximation for k -Center in Graphs
Simultaneous diophantine approximation with excluded primes
Deterministic Skip Lists
Plurality Consensus in the Gossip Model
Optimal Discretization is Fixed-parameter Tractable
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems
Fast randomized algorithms for computing minimum {3, 4, 5, 6}-way cuts
Optimal Deterministic Massively Parallel Connectivity on Forests
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs
Oracle Efficient Online Multicalibration and Omniprediction
Scheduling a pipelined operator graph
The Rank of Diluted Random Graphs
New directions in nearest neighbor searching with applications to lattice sieving
Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract)
The Cost of Parallelizing Boosting
The flow complex: a data structure for geometric modeling
Approximation Algorithms for the Asymmetric Postman Problem
Physical Mapping of Chromosomes Using Unique Probes
Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs
Approximate budget balanced mechanisms with low communication costs for the multicast cost-sharing problem
Closing the Gap Between Directed Hopsets and Shortcut Sets
Approximation Algorithms for Label Cover and The Log-Density Threshold
Nearly Optimal Distributed Edge Colouring in O(log log n) Rounds
Solving Mixed 0-1 Programs by a Lift-and-Project Method
Approximating the average response time in broadcast scheduling
Algorithmizing the Multiplicity Schwartz-Zippel Lemma
Online convex optimization in the bandit setting: gradient descent without a gradient
On the Economic Efficiency of the Combinatorial Clock Auction
Dynamizing static algorithms, with applications to dynamic trees and history independence
Optimal Parallel Approximation for Prefix Sums and Integer Sorting
Higher-Order Cheeger Inequality for Partitioning with Buffers
Bidimensionality and EPTAS
Optimal Binary Space Partitions for Orthogonal Objects
A Sublinear Parallel Algorithm for Stable Matching
Experimental Analysis of Dynamic Minimum Spanning Tree Algorithms (Extended Abstract)
On distributing symmetric streaming computations
Small Memory Robust Simulation of Client-Server Interactive Protocols over Oblivious Noisy Channels
On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion
Streaming Algorithms for Extent Problems in High Dimensions
An unbiased pointing operator for unlabeled structures, with applications to counting and sampling
Approximating geometric coverage problems
Self-improving algorithms
Optimal Oblivious Priority Queues
Finding Endogenously Formed Communities
Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio
Extended Hilbert Irreducibility and its Applications
Digraph minors and algorithms (abstract only)
Improved Space Bounds for Cache-Oblivious Range Reporting
Improved Differentially Private Continual Observation Using Group Algebra
Cake cutting really is not a piece of cake
On Two-Handed Planar Assembly Partitioning with Connectivity Constraints
Unconditional proof of tightness of Johnson bound
Asymptotic dimension of minor-closed families and beyond
An Optimal Lower Bound for Buffer Management in Multi-Queue Switches
Approximation algorithms for stochastic orienteering
A Data Structure for Dynamically Maintaining Rooted Trees
Turning big data into tiny data: Constant-size coresets for k -means, PCA and projective clustering
The Competitiveness of On-Line Assignments
A cell probe lower bound for dynamic nearest-neighbor searching
Caching queues in memory buffers
Perfect matchings via uniform sampling in regular bipartite graphs
Matroidal degree-bounded minimum spanning trees
Improved lower bounds for embeddings into L 1
Approximating the Nash Social Welfare with Budget-Additive Valuations
An improved procedure for colouring graphs of bounded local density
Approximate congruence in nearly linear time
Energy Efficient Scheduling of Parallelizable Jobs
Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization
On the hitting times of quantum versus random walks
Nearly optimal edge estimation with independent set queries
Conflict-Free Coloring of Intersection Graphs of Geometric Objects
Limitations of cross-monotonic cost sharing schemes
Algorithms for power savings
New Data Structures for Orthogonal Range Reporting and Range Minima Queries
Harmonic algorithm for 3-dimensional strip packing problem
Spider covers for prize-collecting network activation problem
On Heilbronn's problem in higher dimension
On Tolerant Distribution Testing in the Conditional Sampling Model
Robust cost colorings
Strongly Competitive Algorithms for Paging with Locality of Reference
A Wide-Range Efficient Algorithm for Minimal Triangulation
Shortest Paths Among Obstacles in the Plane Revisited
Analysis of a Local Search Heuristic for Facility Location Problems
Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays
Single source multiroute flows and cuts on uniform capacity networks
Streaming Submodular Matching Meets the Primal-Dual Method
Optimal routing in Chord
On the bichromatic k -set problem
Sampling algorithms and coresets for ℓ p regression
Guessing secrets efficiently via list decoding
Optimal planar point location
Small Shadows of Lattice Polytopes
Streaming Regular Expression Membership and Pattern Matching
Exponentially slow mixing in the mean-field Swendsen-Wang dynamics
To Cut... or Not to Cut (Applications of Comparative Physical Maps in Molecular Evolution)
Ray Shooting Amidst Convex Polytopes in Three Dimensions
Metric Distortion Bounds for Randomized Social Choice
Consistent k-Clustering for General Metrics
Testing Planarity of Partially Embedded Graphs
1-Pass Relative-Error L p -Sampling with Applications
Rendering Equation Revisited: How to Avoid Explicit Visibility Computations
Approximating the Median under the Ulam Metric
Improved classification via connectivity information
New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling
A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance
New Techniques for the Union-Find Problems
Algorithms and Complexity for Periodic Real-Time Scheduling
Optimal Pricing Schemes for an Impatient Buyer
Focused Stochastic Local Search and the Lovász Local Lemma
On Testability of First-Order Properties in Bounded-Degree Graphs
The wake up and report problem is time-equivalent to the firing squad synchronization problem
Cycles in Adversarial Regularized Learning
Optimal-Time Text Indexing in BWT-runs Bounded Space
Computing all maps into a sphere
Hardness of Permutation Pattern Matching
Facet-Hamiltonicity
Static optimality and dynamic search-optimality in lists and trees
Near linear time (1 + ε)-approximation for restricted shortest paths in undirected graphs
Optimal Edge Ranking of Trees in Linear Time
Pipage Rounding, Pessimistic Estimators and Matrix Concentration
Mobile Geometric Graphs: Detection, Coverage and Percolation
Integer programs with nearly totally unimodular matrices: the cographic case
Top- k document retrieval in optimal time and linear space
Best-Response Dynamics in Combinatorial Auctions with Item Bidding
Temperature 1 Self-Assembly: Deterministic Assembly in 3D and Probabilistic Assembly in 2D
The hunting of the bump: on maximizing statistical discrepancy
On Approximating Rectangle Tiling and Packing
Massively Parallel Approximation Algorithms for Edit Distance and Longest Common Subsequence
Distributed online call control on general networks
Graph Orientations with No Sink and an Approximation for a Hard Case of #SAT
An algorithm for improving graph partitions
A Faster Algorithm for Minimum Cost Submodular Flows
Trade-offs Between Speed and Processor in Hard-Deadline Scheduling
Untangling Planar Graphs and Curves by Staying Positive
The wake-up problem in multi-hop radio networks
Time and Space Efficient Representations of Distributive Lattices
A plant location guide for the unsure
Communication Complexity of Discrete Fair Division
Approximation algorithm for embedding metrics into a two-dimensional space
Coloring with Defect
Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves
Dynamic Facility Location via Exponential Clocks
A Dynamic Programming Framework for Non-Preemptive Scheduling Problems on Multiple Machines [Extended Abstract]
Relative Errors for Deterministic Low-Rank Matrix Approximations
Distributed selfish load balancing
Friendly Cut Sparsifiers and Faster Gomory-Hu Trees
Hardware-assisted computation of depth contours
Markovian Hitters and the Complexity of Blind Rendezvous
Approximate tree decompositions of planar graphs in linear time
Self-adjusting top trees
Selection and Sorting in the "Restore" Model
A Framework for Similarity Search with Space-Time Tradeoffs using Locality-Sensitive Filtering
Algorithms and incentives for robust ranking
Minimizing Interference Potential Among Moving Entities
On Deterministically Approximating Total Variation Distance
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds
On LP-Based Approximability for Strict CSPs
An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling
Approximation Algorithm for Sparsest k -Partitioning
Online Scheduling on Identical Machines using SRPT
Reproducibility and Pseudo-Determinism in Log-Space
A Faster Combinatorial Algorithm for Maximum Bipartite Matching
On Problems Related to Unbounded SubsetSum: A Unified Combinatorial Approach
Optimally Reconstructing Weighted Graphs Using Queries
A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials
The Bloomier filter: an efficient data structure for static support lookup tables
A scaling algorithm for maximum weight matching in bipartite graphs
Computing all Wardrop Equilibria parametrized by the Flow Demand
Deterministic algorithms for the Lovász Local Lemma: simpler, more general, and more parallel
Competitive tree-structured dictionaries
Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
Quality meshing with weighted Delaunay refinement
Who cares about permanents?
A faster and simpler fully dynamic transitive closure
Interleaved Caching with Access Graphs
Probabilistic analysis of knapsack core algorithms
Near Optimal Jointly Private Packing Algorithms via Dual Multiplicative Weight Update
Networks cannot compute their diameter in sublinear time
An approximation algorithm for the group Steiner problem
Weak compositions and their applications to polynomial lower bounds for kernelization
Confluent persistence revisited
Model-based Sketching and Recovery with Expanders
Approximate distance oracles for geometric graphs
On the Decidability of Presburger Arithmetic Expanded with Powers
Stream sampling for variance-optimal estimation of subset sums
Lower bounds for number-in-hand multiparty communication complexity, made easy
Better algorithms for benign bandits
Generalized clustering
Rounding in Lattices and its Cryptographic Applications
How to Get an Exact Sample From a Generic Markov Chain and Sample a Random Spanning Tree From a Directed Graph, Both Within the Cover Time
epsilon-Approximate linear programs: new bounds and computation
Graph decomposition and a greedy algorithm for edge-disjoint paths
A simple and sharper proof of the hypergraph Moore bound
Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs
Polytope approximation and the Mahler volume
Selection in the Presence of Noise: The Design of Playoff Systems
Design of On-line Algorithms Using Hitting Times
Efficient Parallel Computations for Singular Band Matrices
Representative set statements for delta-matroids and the Mader delta-matroid
Polynomial Algorithms for Minimum Cost Paths in Periodic Graphs
Better upper bounds on the Füredi-Hajnal limits of permutations
A Lower Bound on Cycle-Finding in Sparse Digraphs
Slightly Superexponential Parameterized Problems
Scheduling with Communication Delays via LP Hierarchies and Clustering II: Weighted Completion Times on Related Machines
Fast elimination of redundant linear equations and reconstruction of recombination-free mendelian inheritance on a pedigree
Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges
On Bregman Voronoi diagrams
Soft kinetic data structures
Toeplitz Low-Rank Approximation with Sublinear Query Complexity
Approximate Evaluation of First-Order Counting Queries
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
Reconstructing Set Partitions
A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs
Fast asynchronous byzantine agreement and leader election with full information
Partitioning a Graph into Small Pieces with Applications to Path Transversal
On Estimating the Trace of Quantum State Powers
Simple, Fast and Deterministic Gossip and Rumor Spreading
A new approximation algorithm for the asymmetric TSP with triangle inequality
Factoring Pattern-Free Permutations into Separable ones
Adversarial Low Degree Testing
Quantum algorithms and approximating polynomials for composed functions with shared inputs
A general approach to online network optimization problems
Algorithms for Total Weighted Completion Time Scheduling
On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization
Computer assisted proof of optimal approximability results
Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack
Solving hard cut problems via flow-augmentation
(1 + ε)-Approximate Incremental Matching in Constant Deterministic Amortized Time
Determinant Algorithms for Random Planar Structures
Subgraph Isomorphism in Planar Graphs and Related Problems
Computing the second and third systoles of a combinatorial surface
"Who is Next in Line?" On the Significance of Knowing the Arrival Order in Bayesian Online Settings
Recognizing a Totally Odd K 4 -subdivision, Parity 2-disjoint Rooted Paths and a Parity Cycle Through Specified Elements
A categorization theorem on suffix arrays with applications to space efficient text indexes
Polynomial formulations as a barrier for reduction-based hardness proofs
Efficient resilient functions
New Algorithms for Minimum Area k -gons
An Algorithmic Hypergraph Regularity Lemma
Online client-server load balancing without global information
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank
An improved approximation algorithm for combinatorial auctions with submodular bidders
Point Line Cover: The Easy Kernel is Essentially Tight
Universal configurations in light-flipping games
Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms
Approximate resilience, monotonicity, and the complexity of agnostic learning
Randomly Sampling Molecules
Instance-Optimality in the Noisy Value-and Comparison-Model
Iterated rounding algorithms for the smallest k -edge connected spanning subgraph
Approximating connectivity augmentation problems
Parametric Optimization of Sequence Alignment
From Graph Properties to Graph Parameters: Tight Bounds for Counting on Small Subgraphs
Complexities for generalized models of self-assembly
The size of the core in assignment markets
Algorithms for the Maxium Subarray Problem Based on Matrix Multiplication
Real-time indexing over fixed finite alphabets
Weighted Flowtime on Capacitated Machines
A Deterministic Truthful PTAS for Scheduling Related Machines
Online Scheduling via Gradient Descent for Weighted Flow Time Minimization
Symmetric drawings of triconnected planar graphs
Optimal Las Vegas Approximate Near Neighbors in ℓp
Strong Concentration for Quicksort
Improved range-summable random variable construction algorithms