STOC 2003 - PDF Preprint Papers

STOC 2003 Annual ACM Symposium on Theory of Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed STOC-2003 Paper

click to vote

STOC
2003
ACM

193views Algorithms» more STOC 2003»

Space efficient dynamic stabbing with fast queries

14 years 4 months ago

Download www.cs.ust.hk

In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...

Mikkel Thorup

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	193	Space efficient dynamic stabbing with fast queries	claim
2	188	Almost random graphs with simple hash functions	claim
3	178	Uniform hashing in constant time and linear space	claim
4	174	Adiabatic quantum state generation and statistical zero knowledge	claim
5	171	Primal-dual meets local search: approximating MST's with nonuniform degree bounds	claim
6	164	Approximate counting by dynamic programming	claim
7	154	Boosting in the presence of noise	claim
8	153	Sublinear geometric algorithms	claim
9	152	Reducing truth-telling online mechanisms to online optimization	claim
10	152	Cell-probe lower bounds for the partial match problem	claim
11	142	Optimal probabilistic fingerprint codes	claim
12	141	Better streaming algorithms for clustering problems	claim
13	140	Cutting triangular cycles of lines in space	claim
14	140	Approximation schemes for clustering problems	claim
15	137	Near-optimal network design with selfish agents	claim
16	136	Alpha-shapes and flow shapes are homotopy equivalent	claim
17	135	Linear time encodable and list decodable codes	claim
18	133	A fast algorithm for computing steiner edge connectivity	claim
19	130	A tight bound on approximating arbitrary metrics by tree metrics	claim
20	126	A new approach to dynamic all pairs shortest paths	claim
21	124	Extractors: optimal up to constant factors	claim
22	122	Learning juntas	claim
23	119	Constant factor approximation of vertex-cuts in planar graphs	claim
24	119	A stochastic process on the hypercube with applications to peer-to-peer networks	claim
25	118	A proof of Alon's second eigenvalue conjecture	claim
26	118	Exponential lower bound for 2-query locally decodable codes via a quantum argument	claim
27	117	Distinct distances in three and higher dimensions	claim
28	116	New lattice based cryptographic constructions	claim
29	114	Testing subgraphs in directed graphs	claim
30	114	Well-separated pair decomposition for the unit-disk graph metric and its applications	claim
31	114	Approximation algorithms for hierarchical location problems	claim
32	110	Non-interactive and reusable non-malleable commitment schemes	claim
33	110	New degree bounds for polynomial threshold functions	claim
34	109	Generating random regular graphs	claim
35	109	A new multilayered PCP and the hardness of hypergraph vertex cover	claim
36	108	Short path queries in planar graphs in constant time	claim
37	103	The worst-case behavior of schnorr's algorithm approximating the shortest nonzero vector in a lattice	claim
38	102	On metric ramsey-type phenomena	claim
39	102	Some 3CNF properties are hard to test	claim
40	101	Randomly coloring graphs of girth at least five	claim
41	100	Simpler and better approximation algorithms for network design	claim
42	99	On the fractal behavior of TCP	claim
43	98	The online set cover problem	claim
44	98	A sublinear algorithm for weakly approximating edit distance	claim
45	98	On the limits of cache-obliviousness	claim
46	98	Consistent load balancing via spread minimization	claim
47	96	Optimal oblivious routing in polynomial time	claim
48	95	Random knapsack in expected polynomial time	claim
49	95	On the power of quantum fingerprinting	claim
50	92	Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions	claim
51	91	Pricing network edges for heterogeneous selfish users	claim
52	90	Work-competitive scheduling for cooperative computing with dynamic groups	claim
53	88	Exponential algorithmic speedup by a quantum walk	claim
54	87	The intrinsic dimensionality of graphs	claim
55	86	Meet and merge: approximation algorithms for confluent flows	claim
56	85	Derandomizing polynomial identity tests means proving circuit lower bounds	claim
57	80	Polylogarithmic inapproximability	claim
58	78	Touring a sequence of polygons	claim
59	72	OPT versus LOAD in dynamic storage allocation	claim
60	65	Randomness-efficient low degree tests and short PCPs via epsilon-biased sets	claim
61	64	Hidden translation and orbit coset in quantum computing	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers