SODA 2003 - PDF Preprint Papers

SODA 2003 Symposium on Discrete Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SODA-2003 Paper

click to vote

SODA
2003
ACM

167views Algorithms» more SODA 2003»

Counting inversions in lists

14 years 24 days ago

Download www.cs.cmu.edu

In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...

Anupam Gupta, Francis Zane

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	167	Counting inversions in lists	claim
2	158	Faster approximation algorithms for the minimum latency problem	claim
3	158	Comparing top k lists	claim
4	157	Competitive queueing policies for QoS switches	claim
5	143	Matching planar maps	claim
6	143	Deterministic identity testing for multivariate polynomials	claim
7	142	The similarity metric	claim
8	139	Compact representations of separable graphs	claim
9	138	Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs	claim
10	133	Integrality ratio for group Steiner trees and directed steiner trees	claim
11	132	Online learning in online auctions	claim
12	131	Zonotopes as bounding volumes	claim
13	131	Root comparison techniques applied to computing the additively weighted Voronoi diagram	claim
14	130	Directed scale-free graphs	claim
15	127	The set-associative cache performance of search trees	claim
16	127	Binary space partitions for 3D subdivisions	claim
17	126	Smaller core-sets for balls	claim
18	126	The cover time of sparse random graphs	claim
19	125	Random MAX SAT, random MAX CUT, and their phase transitions	claim
20	122	Certifying and repairing solutions to large LPs how good are LP-solvers?	claim
21	122	Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons	claim
22	121	Competitiveness via consensus	claim
23	121	An improved approximation algorithm for the partial latin square extension problem	claim
24	121	Improved results for directed multicut	claim
25	120	Certifying algorithms for recognizing interval graphs and permutation graphs	claim
26	119	Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk	claim
27	118	Approximation of functions over redundant dictionaries using coherence	claim
28	118	Data streams: algorithms and applications	claim
29	116	Browsing around a digital library	claim
30	115	Random walks on the vertices of transportation polytopes with constant number of sources	claim
31	114	Lower bounds for collusion-secure fingerprinting	claim
32	112	Perturbations and vertex removal in a 3D delaunay triangulation	claim
33	110	Graded conforming Delaunay tetrahedralization with bounded radius-edge ratio	claim
34	107	Fault-tolerant facility location	claim
35	106	Maintaining all-pairs approximate shortest paths under deletion of edges	claim
36	105	Quantum property testing	claim
37	103	Embedding k-outerplanar graphs into l1	claim
38	103	On the rectilinear crossing number of complete graphs	claim
39	102	On the complexity of distance-based evolutionary tree reconstruction	claim
40	102	Online paging with arbitrary associativity	claim
41	101	A new approximation algorithm for the asymmetric TSP with triangle inequality	claim
42	100	Quantum algorithms for some hidden shift problems	claim
43	97	Lower bounds for external memory dictionaries	claim
44	96	Dominating sets in planar graphs: branch-width and exponential speed-up	claim
45	94	Sublinear-time approximation of Euclidean minimum spanning tree	claim
46	90	Dynamic TCP acknowledgement: penalizing long delays	claim
47	88	Lower bounds for embedding edit distance into normed spaces	claim
48	81	Smaller explicit superconcentrators	claim
49	81	High-order entropy-compressed text indexes	claim
50	79	Skip graphs	claim
51	64	Scheduling techniques for media-on-demand	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers