
Conferences in DBLP
On the Optimality of Spiral Search. [Citation Graph (, )][DBLP]
An Improved Competitive Algorithm for Reordering Buffer Management. [Citation Graph (, )][DBLP]
How to Meet Asynchronously (Almost) Everywhere. [Citation Graph (, )][DBLP]
A 1.43Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model. [Citation Graph (, )][DBLP]
Towards the Randomized kServer Conjecture: A PrimalDual Approach. [Citation Graph (, )][DBLP]
Testing Monotone Continuous Distributions on Highdimensional Real Cubes. [Citation Graph (, )][DBLP]
Property Testing and Parameter Testing for Permutations. [Citation Graph (, )][DBLP]
NearOptimal Sublinear Time Algorithms for Ulam Distance. [Citation Graph (, )][DBLP]
Lower Bounds for Testing Trianglefreeness in Boolean Functions. [Citation Graph (, )][DBLP]
Counting Stars and Other Small Subgraphs in Sublinear Time. [Citation Graph (, )][DBLP]
CellProbe Lower Bounds for Succinct Partial Sums. [Citation Graph (, )][DBLP]
On the Cell Probe Complexity of Dynamic Membership. [Citation Graph (, )][DBLP]
FullyFunctional Succinct Trees. [Citation Graph (, )][DBLP]
Data Structures for Range Minimum Queries in Multidimensional Arrays. [Citation Graph (, )][DBLP]
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems. [Citation Graph (, )][DBLP]
Differential Privacy in New Settings. [Citation Graph (, )][DBLP]
Lower Bounds for Edit Distance and Product Metrics via PoincaréType Inequalities. [Citation Graph (, )][DBLP]
Genus and the Geometry of the Cut Graph. [Citation Graph (, )][DBLP]
Testing Planarity of Partially Embedded Graphs. [Citation Graph (, )][DBLP]
Inapproximability for Planar Embedding Problems. [Citation Graph (, )][DBLP]
Towards a Calculus for NonLinear Spectral Gaps. [Citation Graph (, )][DBLP]
A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics. [Citation Graph (, )][DBLP]
PTAS for Maximum Weight Independent Set Problem with Random Weights in Bounded Degree Graphs. [Citation Graph (, )][DBLP]
Belief Propagation for Mincost Network Flow: Convergence & Correctness. [Citation Graph (, )][DBLP]
Finding the Jaccard Median. [Citation Graph (, )][DBLP]
The Focus of Attention Problem. [Citation Graph (, )][DBLP]
Recognizing a Totally Odd K_{4}subdivision, Parity 2disjoint Rooted Paths and a Parity Cycle Through Specified Elements. [Citation Graph (, )][DBLP]
Decomposition, Approximation, and Coloring of OddMinorFree Graphs. [Citation Graph (, )][DBLP]
The Edge Disjoint Paths Problem in Eulerian Graphs and 4edgeconnected Graphs. [Citation Graph (, )][DBLP]
On Brambles, GridLike Minors, and Parameterized Intractability of Monadic SecondOrder Logic. [Citation Graph (, )][DBLP]
An (almost) Linear Time Algorithm for Odd Cyles Transversal. [Citation Graph (, )][DBLP]
An O(log n/ log log n)approximation Algorithm for the Asymmetric Traveling Salesman Problem. [Citation Graph (, )][DBLP]
A Quasipolynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing. [Citation Graph (, )][DBLP]
Region Growing for MultiRoute Cuts. [Citation Graph (, )][DBLP]
Asymmetric Traveling Salesman Path and Directed Latency Problems. [Citation Graph (, )][DBLP]
Improved Approximation Algorithms for the Minimum Latency Problem via PrizeCollecting Strolls. [Citation Graph (, )][DBLP]
Quantum Algorithms for Highly NonLinear Boolean Functions. [Citation Graph (, )][DBLP]
Compact Ancestry Labeling Schemes for XML Trees. [Citation Graph (, )][DBLP]
Generating a ddimensional Linear Subspace Efficiently. [Citation Graph (, )][DBLP]
Algorithms for Ray Class Groups and Hilbert Class Fields. [Citation Graph (, )][DBLP]
A SpaceTime Tradeoff for Permutation Problems. [Citation Graph (, )][DBLP]
Algorithmic Lower Bounds for Problems Parameterized with CliqueWidth. [Citation Graph (, )][DBLP]
Bidimensionality and Kernels. [Citation Graph (, )][DBLP]
Solving MAXrSAT Above a Tight Lower Bound. [Citation Graph (, )][DBLP]
Inapproximability for VCGBased Combinatorial Auctions. [Citation Graph (, )][DBLP]
Price of Anarchy for Greedy Auctions. [Citation Graph (, )][DBLP]
Incentive Compatible Budget Elicitation in Multiunit Auctions. [Citation Graph (, )][DBLP]
Utilitarian Mechanism Design for MultiObjective Optimization. [Citation Graph (, )][DBLP]
Pricing Randomized Allocations. [Citation Graph (, )][DBLP]
Universal epsilonapproximators for Integrals. [Citation Graph (, )][DBLP]
Optimally Reconstructing Weighted Graphs Using Queries. [Citation Graph (, )][DBLP]
Online Learning with Queries. [Citation Graph (, )][DBLP]
Coresets and Sketches for High Dimensional Subspace Approximation Problems. [Citation Graph (, )][DBLP]
Convergence, Stability, and Discrete Approximation of Laplace Spectra. [Citation Graph (, )][DBLP]
Sharp Kernel Clustering Algorithms and Their Associated Grothendieck Inequalities. [Citation Graph (, )][DBLP]
Fast SDP Algorithms for Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]
Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital Communications. [Citation Graph (, )][DBLP]
Correlation Clustering with Noisy Input. [Citation Graph (, )][DBLP]
A Polynomial Time Approximation Scheme for kConsensus Clustering. [Citation Graph (, )][DBLP]
Google's Auction for TV Ads. [Citation Graph (, )][DBLP]
A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General Graphs. [Citation Graph (, )][DBLP]
Solving the Replacement Paths Problem for Planar Directed Graphs in O(n log n) Time. [Citation Graph (, )][DBLP]
Bounding Variance and Expectation of Longest Path Lengths in DAGs. [Citation Graph (, )][DBLP]
Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. [Citation Graph (, )][DBLP]
Maximum Flows and Parametric Shortest Paths in Planar Graphs. [Citation Graph (, )][DBLP]
On the Equilibria of Alternating Move Games. [Citation Graph (, )][DBLP]
Monotonicity in Bargaining Networks. [Citation Graph (, )][DBLP]
Sharp Dichotomies for Regret Minimization in Metric Spaces. [Citation Graph (, )][DBLP]
Solving Simple Stochastic Tail Games. [Citation Graph (, )][DBLP]
OneCounter Markov Decision Processes. [Citation Graph (, )][DBLP]
On Nonlinear Forbidden 01 Matrices: A Refutation of a FürediHajnal Conjecture. [Citation Graph (, )][DBLP]
An Improved Construction of ProgressionFree Sets. [Citation Graph (, )][DBLP]
Geometric Optimization and Sums of Algebraic Functions. [Citation Graph (, )][DBLP]
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. [Citation Graph (, )][DBLP]
How Far Can You Reach? [Citation Graph (, )][DBLP]
A Model of Computation for MapReduce. [Citation Graph (, )][DBLP]
Synchrony and Asynchrony in Neural Networks. [Citation Graph (, )][DBLP]
Distributed Agreement with Optimal Communication Complexity. [Citation Graph (, )][DBLP]
How Good is the Chord Algorithm?. [Citation Graph (, )][DBLP]
Deterministic Algorithms for the Lovász Local Lemma. [Citation Graph (, )][DBLP]
A Deterministic Truthful PTAS for Scheduling Related Machines. [Citation Graph (, )][DBLP]
A Fourier Space Algorithm for Solving Quadratic Assignment Problems. [Citation Graph (, )][DBLP]
EDFschedulability of Synchronous Periodic Task Systems is coNPhard. [Citation Graph (, )][DBLP]
Reconstructing Approximate Phylogenetic Trees from Quartet Samples. [Citation Graph (, )][DBLP]
Shape Replication through SelfAssembly and RNase Enzymes. [Citation Graph (, )][DBLP]
On the Possibility of Faster SAT Algorithms. [Citation Graph (, )][DBLP]
Paired Approximation Problems and Incompatible Inapproximabilities. [Citation Graph (, )][DBLP]
Correlation Robust Stochastic Optimization. [Citation Graph (, )][DBLP]
Approximability of Robust Network Design. [Citation Graph (, )][DBLP]
Differentially Private Combinatorial Optimization. [Citation Graph (, )][DBLP]
Efficiently Decodable Nonadaptive Group Testing. [Citation Graph (, )][DBLP]
1Pass RelativeError L_{p}Sampling with Applications. [Citation Graph (, )][DBLP]
On the Exact Space Complexity of Sketching and Streaming Small Norms. [Citation Graph (, )][DBLP]
A LocalitySensitive Hash for Real Vectors. [Citation Graph (, )][DBLP]
Lower Bounds for Sparse Recovery. [Citation Graph (, )][DBLP]
FlowCut Gaps for Integer and Fractional Multiflows. [Citation Graph (, )][DBLP]
A MaxFlow/MinCut Algorithm for a Class of Wireless Networks. [Citation Graph (, )][DBLP]
Testing Additive Integrality Gaps. [Citation Graph (, )][DBLP]
Classified Stable Matching. [Citation Graph (, )][DBLP]
Basis Reduction and the Complexity of BrandandBound. [Citation Graph (, )][DBLP]
Randomized Shellsort: A Simple Oblivious Sorting Algorithm. [Citation Graph (, )][DBLP]
DataSpecific Analysis of String Sorting. [Citation Graph (, )][DBLP]
Fast Distance Multiplication of UnitMonge Matrices. [Citation Graph (, )][DBLP]
Regular Expression Matching with MultiStrings and Intervals. [Citation Graph (, )][DBLP]
Road Network Reconstruction for Organizing Paths. [Citation Graph (, )][DBLP]
The Power of Convex Relaxation: The Surprising Stories of Matrix Completion and Compressed Sensing. [Citation Graph (, )][DBLP]
An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling. [Citation Graph (, )][DBLP]
Resource Minimization for Fire Containment. [Citation Graph (, )][DBLP]
Algorithms and Complexity for Periodic RealTime Scheduling. [Citation Graph (, )][DBLP]
Energy Efficient Scheduling via Partial Shutdown. [Citation Graph (, )][DBLP]
SRPT is 1.86Competitive for Completion Time Scheduling. [Citation Graph (, )][DBLP]
The Rank of Diluted Random Graphs. [Citation Graph (, )][DBLP]
The Scaling Window for a Random Graph with a Given Degree Sequence. [Citation Graph (, )][DBLP]
Efficient Broadcast on Random Geometric Graphs. [Citation Graph (, )][DBLP]
Speeding Up Random Walks with Neighborhood Exploration. [Citation Graph (, )][DBLP]
Vertices of Degree k in Random Maps. [Citation Graph (, )][DBLP]
CacheOblivious Dynamic Dictionaries with Update/Query Tradeoffs. [Citation Graph (, )][DBLP]
Applications of Forbidden 01 Matrices to Search Tree and Path CompressionBased Data Structures. [Citation Graph (, )][DBLP]
Faster Exponential Time Algorithms for the Shortest Vector Problem. [Citation Graph (, )][DBLP]
Streaming Algorithms for Extent Problems in High Dimensions. [Citation Graph (, )][DBLP]
Deletion Without Rebalancing in Balanced Binary Trees. [Citation Graph (, )][DBLP]
On Linear and Semidefinite Programming Relaxations for Hypergraph Matching. [Citation Graph (, )][DBLP]
Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph. [Citation Graph (, )][DBLP]
Tree Embeddings for TwoEdgeConnected Network Design. [Citation Graph (, )][DBLP]
A Constant Factor Approximation Algorithm for Generalized MinSum Set Cover. [Citation Graph (, )][DBLP]
Selfimproving Algorithms for Convex Hulls. [Citation Graph (, )][DBLP]
The Forest Hiding Problem. [Citation Graph (, )][DBLP]
Terrain Guarding is NPHard. [Citation Graph (, )][DBLP]
Hardness Results for Homology Localization. [Citation Graph (, )][DBLP]
Orthogonal HamSandwich Theorem in R^{3}. [Citation Graph (, )][DBLP]
The (1 + beta)Choice Process and Weighted BallsintoBins. [Citation Graph (, )][DBLP]
Quasirandom Load Balancing. [Citation Graph (, )][DBLP]
Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies. [Citation Graph (, )][DBLP]
Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees. [Citation Graph (, )][DBLP]
Rumour Spreading and Graph Conductance. [Citation Graph (, )][DBLP]
