
Conferences in DBLP
Fast dimension reduction using Rademacher series on dual BCH codes. [Citation Graph (, )][DBLP]
Estimators and tail bounds for dimension reduction in lα (0 < α ≤ 2) using stable random projections. [Citation Graph (, )][DBLP]
A deterministic sublinear time sparse fourier algorithm via nonadaptive compressed sensing methods. [Citation Graph (, )][DBLP]
Explicit constructions for compressed sensing of sparse signals. [Citation Graph (, )][DBLP]
Improved distance sensitivity oracles via random sampling. [Citation Graph (, )][DBLP]
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. [Citation Graph (, )][DBLP]
Holographic algorithms with unsymmetric signatures. [Citation Graph (, )][DBLP]
The UGC hardness threshold of the ℓ_{p} Grothendieck problem. [Citation Graph (, )][DBLP]
Succinct approximate convex pareto curves. [Citation Graph (, )][DBLP]
Efficient reductions among lattice problems. [Citation Graph (, )][DBLP]
Delaunay graphs of point sets in the plane with respect to axisparallel rectangles. [Citation Graph (, )][DBLP]
Greedy drawings of triangulations. [Citation Graph (, )][DBLP]
Maintaining deforming surface meshes. [Citation Graph (, )][DBLP]
Exact and efficient 2Darrangements of arbitrary algebraic curves. [Citation Graph (, )][DBLP]
On properties of random dissections and triangulations. [Citation Graph (, )][DBLP]
Graph algorithms for biological systems analysis. [Citation Graph (, )][DBLP]
Adaptive local ratio. [Citation Graph (, )][DBLP]
Twophase greedy algorithms for some classes of combinatorial linear programs. [Citation Graph (, )][DBLP]
Analysis of greedy approximations with nonsubmodular potential functions. [Citation Graph (, )][DBLP]
Yet another algorithm for dense max cut: go greedy. [Citation Graph (, )][DBLP]
Computing large matchings fast. [Citation Graph (, )][DBLP]
A fractional model of the border gateway protocol (BGP). [Citation Graph (, )][DBLP]
Minimizing average latency in oblivious routing. [Citation Graph (, )][DBLP]
Distributed broadcast in unknown radio networks. [Citation Graph (, )][DBLP]
The power of memory in randomized broadcasting. [Citation Graph (, )][DBLP]
Competitive queue management for latency sensitive packets. [Citation Graph (, )][DBLP]
Rapid mixing of Gibbs sampling on graphs that are sparse on average. [Citation Graph (, )][DBLP]
Product growth and mixing in finite groups. [Citation Graph (, )][DBLP]
Concatenated codes can achieve listdecoding capacity. [Citation Graph (, )][DBLP]
Noisy sorting without resampling. [Citation Graph (, )][DBLP]
Algorithms for the coalitional manipulation problem. [Citation Graph (, )][DBLP]
On allocations that maximize fairness. [Citation Graph (, )][DBLP]
On the value of coordination in network design. [Citation Graph (, )][DBLP]
Auctions for structured procurement. [Citation Graph (, )][DBLP]
Fast load balancing via bounded best response. [Citation Graph (, )][DBLP]
(Almost) optimal coordination mechanisms for unrelated machine scheduling. [Citation Graph (, )][DBLP]
Ultralowdimensional embeddings for doubling metrics. [Citation Graph (, )][DBLP]
Earth mover distance over highdimensional spaces. [Citation Graph (, )][DBLP]
Almost Euclidean subspaces of l^{N}_{1} via expander codes. [Citation Graph (, )][DBLP]
Embedding metric spaces in their intrinsic dimension. [Citation Graph (, )][DBLP]
Optimal universal graphs with deterministic embedding. [Citation Graph (, )][DBLP]
Fast and reliable reconstruction of phylogenetic trees with very short edges. [Citation Graph (, )][DBLP]
Trace reconstruction with constant deletion probability and related results. [Citation Graph (, )][DBLP]
Improved string reconstruction over insertiondeletion channels. [Citation Graph (, )][DBLP]
Dimension augmentation and combinatorial criteria for efficient errorresistant DNA selfassembly. [Citation Graph (, )][DBLP]
Approximating general metric distances between a pattern and a text. [Citation Graph (, )][DBLP]
A nearlinear time algorithm for computing replacement paths in planar directed graphs. [Citation Graph (, )][DBLP]
Boundedleg distance and reachability oracles. [Citation Graph (, )][DBLP]
A nearly linear time algorithm for the half integral disjoint paths packing. [Citation Graph (, )][DBLP]
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. [Citation Graph (, )][DBLP]
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule. [Citation Graph (, )][DBLP]
Broadcast scheduling: algorithms and complexity. [Citation Graph (, )][DBLP]
Graph balancing: a special case of scheduling unrelated parallel machines. [Citation Graph (, )][DBLP]
Nonclairvoyant scheduling with precedence constraints. [Citation Graph (, )][DBLP]
Provably good multicore cache performance for divideandconquer algorithms. [Citation Graph (, )][DBLP]
Balls and bins with structure: balanced allocations on hypergraphs. [Citation Graph (, )][DBLP]
Arcdisjoint intrees in directed graphs. [Citation Graph (, )][DBLP]
Finding one tight cycle. [Citation Graph (, )][DBLP]
Set connectivity problems in undirected graphs and the directed Steiner network problem. [Citation Graph (, )][DBLP]
Matroid intersection, pointer chasing, and Young's seminormal representation of S_{n}. [Citation Graph (, )][DBLP]
Iterated rounding algorithms for the smallest kedge connected spanning subgraph. [Citation Graph (, )][DBLP]
Shuffling cards, adding numbers, and symmetric functions. [Citation Graph (, )][DBLP]
On the bichromatic kset problem. [Citation Graph (, )][DBLP]
Geodesic Delaunay triangulation and witness complex in the plane. [Citation Graph (, )][DBLP]
Minimum weight convex Steiner partitions. [Citation Graph (, )][DBLP]
Improved algorithms for fully dynamic geometric spanners and geometric routing. [Citation Graph (, )][DBLP]
On the connectivity of dynamic random geometric graphs. [Citation Graph (, )][DBLP]
Improved algorithmic versions of the Lovász Local Lemma. [Citation Graph (, )][DBLP]
L(2, 1)labelling of graphs. [Citation Graph (, )][DBLP]
Catalan structures and dynamic programming in Hminorfree graphs. [Citation Graph (, )][DBLP]
Computing excluded minors. [Citation Graph (, )][DBLP]
An algorithm for improving graph partitions. [Citation Graph (, )][DBLP]
Improved algorithms for orienteering and related problems. [Citation Graph (, )][DBLP]
Approximation algorithms for labeling hierarchical taxonomies. [Citation Graph (, )][DBLP]
Fast approximation of the permanent for very dense problems. [Citation Graph (, )][DBLP]
Approximating TSP on metrics with bounded global growth. [Citation Graph (, )][DBLP]
Fully polynomial time approximation schemes for stochastic dynamic programs. [Citation Graph (, )][DBLP]
On distributing symmetric streaming computations. [Citation Graph (, )][DBLP]
Tight lower bounds for selection in randomly ordered streams. [Citation Graph (, )][DBLP]
On distance to monotonicity and longest increasing subsequence of a data stream. [Citation Graph (, )][DBLP]
Declaring independence via the sketching of sketches. [Citation Graph (, )][DBLP]
Why simple hash functions work: exploiting the entropy in a data stream. [Citation Graph (, )][DBLP]
Maximum overhang. [Citation Graph (, )][DBLP]
Deterministic random walks on regular trees. [Citation Graph (, )][DBLP]
Quasirandom rumor spreading. [Citation Graph (, )][DBLP]
Universality of random graphs. [Citation Graph (, )][DBLP]
The effect of induced subgraphs on quasirandomness. [Citation Graph (, )][DBLP]
Clustering for metric and nonmetric distance measures. [Citation Graph (, )][DBLP]
Metric clustering via consistent labeling. [Citation Graph (, )][DBLP]
On clustering to minimize the sum of radii. [Citation Graph (, )][DBLP]
A constant factor approximation algorithm for kmedian clustering with outliers. [Citation Graph (, )][DBLP]
Geometric clustering: fixedparameter tractability and lower bounds with respect to the dimension. [Citation Graph (, )][DBLP]
The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond. [Citation Graph (, )][DBLP]
Designing networks with good equilibria. [Citation Graph (, )][DBLP]
Ascending auctions for integral (poly)matroids with concave nondecreasing separable values. [Citation Graph (, )][DBLP]
Fast algorithms for finding proper strategies in game trees. [Citation Graph (, )][DBLP]
Incentive compatible regression learning. [Citation Graph (, )][DBLP]
Spaceefficient dynamic orthogonal point location, segment intersection, and range reporting. [Citation Graph (, )][DBLP]
Inplace 2d nearest neighbor search. [Citation Graph (, )][DBLP]
Distributionsensitive point location in convex subdivisions. [Citation Graph (, )][DBLP]
Coresets, sparse greedy approximation, and the FrankWolfe algorithm. [Citation Graph (, )][DBLP]
Sampling algorithms and coresets for ℓ_{p} regression. [Citation Graph (, )][DBLP]
Stochastic analyses for online combinatorial optimization problems. [Citation Graph (, )][DBLP]
Online maketoorder joint replenishment model: primal dual competitive algorithms. [Citation Graph (, )][DBLP]
Parallel monotonicity reconstruction. [Citation Graph (, )][DBLP]
Better bounds for online load balancing on unrelated machines. [Citation Graph (, )][DBLP]
Online budgeted matching in random input models with applications to Adwords. [Citation Graph (, )][DBLP]
Computational advertising. [Citation Graph (, )][DBLP]
Linked decompositions of networks and the power of choice in Polya urns. [Citation Graph (, )][DBLP]
A local algorithm for finding dense subgraphs. [Citation Graph (, )][DBLP]
PageRank and the random surfer model. [Citation Graph (, )][DBLP]
Charity auctions on social networks. [Citation Graph (, )][DBLP]
On the approximability of influence in social networks. [Citation Graph (, )][DBLP]
Fast asynchronous byzantine agreement and leader election with full information. [Citation Graph (, )][DBLP]
Unconditionally reliable message transmission in directed networks. [Citation Graph (, )][DBLP]
A tight lower bound for parity in noisy communication networks. [Citation Graph (, )][DBLP]
Ranged hash functions and the price of churn. [Citation Graph (, )][DBLP]
Algorithms for distributed functional monitoring. [Citation Graph (, )][DBLP]
Realtime indexing over fixed finite alphabets. [Citation Graph (, )][DBLP]
Finding an optimal tree searching strategy in linear time. [Citation Graph (, )][DBLP]
Dynamic optimality for skip lists and Btrees. [Citation Graph (, )][DBLP]
Splay trees, DavenportSchinzel sequences, and the deque conjecture. [Citation Graph (, )][DBLP]
Fully dynamic algorithm for graph spanners with polylogarithmic update time. [Citation Graph (, )][DBLP]
SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems. [Citation Graph (, )][DBLP]
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities. [Citation Graph (, )][DBLP]
Lowerbounded facility location. [Citation Graph (, )][DBLP]
A plant location guide for the unsure. [Citation Graph (, )][DBLP]
Approximating connected facility location problems via random facility sampling and core detouring. [Citation Graph (, )][DBLP]
The hiring problem and Lake Wobegon strategies. [Citation Graph (, )][DBLP]
Weak εnets and interval chains. [Citation Graph (, )][DBLP]
Robust cost colorings. [Citation Graph (, )][DBLP]
Comparing the strength of query types in property testing: the case of testing kcolorability. [Citation Graph (, )][DBLP]
Sampling stable marriages: why spouseswapping won't work. [Citation Graph (, )][DBLP]
On stars and Steiner stars. [Citation Graph (, )][DBLP]
Cutting cycles of rods in space: hardness and approximation. [Citation Graph (, )][DBLP]
Emptyellipse graphs. [Citation Graph (, )][DBLP]
Recognizing partial cubes in quadratic time. [Citation Graph (, )][DBLP]
Approximating geometric coverage problems. [Citation Graph (, )][DBLP]
