The SCEAS System
Navigation Menu

Conferences in DBLP

Symposium on Discrete Algorithms (SODA) (soda)
2008 (conf/soda/2008)


  1. Fast dimension reduction using Rademacher series on dual BCH codes. [Citation Graph (, )][DBLP]


  2. Estimators and tail bounds for dimension reduction in lα (0 < α ≤ 2) using stable random projections. [Citation Graph (, )][DBLP]


  3. A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methods. [Citation Graph (, )][DBLP]


  4. Explicit constructions for compressed sensing of sparse signals. [Citation Graph (, )][DBLP]


  5. Improved distance sensitivity oracles via random sampling. [Citation Graph (, )][DBLP]


  6. Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. [Citation Graph (, )][DBLP]


  7. Holographic algorithms with unsymmetric signatures. [Citation Graph (, )][DBLP]


  8. The UGC hardness threshold of the ℓp Grothendieck problem. [Citation Graph (, )][DBLP]


  9. Succinct approximate convex pareto curves. [Citation Graph (, )][DBLP]


  10. Efficient reductions among lattice problems. [Citation Graph (, )][DBLP]


  11. Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. [Citation Graph (, )][DBLP]


  12. Greedy drawings of triangulations. [Citation Graph (, )][DBLP]


  13. Maintaining deforming surface meshes. [Citation Graph (, )][DBLP]


  14. Exact and efficient 2D-arrangements of arbitrary algebraic curves. [Citation Graph (, )][DBLP]


  15. On properties of random dissections and triangulations. [Citation Graph (, )][DBLP]


  16. Graph algorithms for biological systems analysis. [Citation Graph (, )][DBLP]


  17. Adaptive local ratio. [Citation Graph (, )][DBLP]


  18. Two-phase greedy algorithms for some classes of combinatorial linear programs. [Citation Graph (, )][DBLP]


  19. Analysis of greedy approximations with nonsubmodular potential functions. [Citation Graph (, )][DBLP]


  20. Yet another algorithm for dense max cut: go greedy. [Citation Graph (, )][DBLP]


  21. Computing large matchings fast. [Citation Graph (, )][DBLP]


  22. A fractional model of the border gateway protocol (BGP). [Citation Graph (, )][DBLP]


  23. Minimizing average latency in oblivious routing. [Citation Graph (, )][DBLP]


  24. Distributed broadcast in unknown radio networks. [Citation Graph (, )][DBLP]


  25. The power of memory in randomized broadcasting. [Citation Graph (, )][DBLP]


  26. Competitive queue management for latency sensitive packets. [Citation Graph (, )][DBLP]


  27. Rapid mixing of Gibbs sampling on graphs that are sparse on average. [Citation Graph (, )][DBLP]


  28. Product growth and mixing in finite groups. [Citation Graph (, )][DBLP]


  29. Concatenated codes can achieve list-decoding capacity. [Citation Graph (, )][DBLP]


  30. Noisy sorting without resampling. [Citation Graph (, )][DBLP]


  31. Algorithms for the coalitional manipulation problem. [Citation Graph (, )][DBLP]


  32. On allocations that maximize fairness. [Citation Graph (, )][DBLP]


  33. On the value of coordination in network design. [Citation Graph (, )][DBLP]


  34. Auctions for structured procurement. [Citation Graph (, )][DBLP]


  35. Fast load balancing via bounded best response. [Citation Graph (, )][DBLP]


  36. (Almost) optimal coordination mechanisms for unrelated machine scheduling. [Citation Graph (, )][DBLP]


  37. Ultra-low-dimensional embeddings for doubling metrics. [Citation Graph (, )][DBLP]


  38. Earth mover distance over high-dimensional spaces. [Citation Graph (, )][DBLP]


  39. Almost Euclidean subspaces of lN1 via expander codes. [Citation Graph (, )][DBLP]


  40. Embedding metric spaces in their intrinsic dimension. [Citation Graph (, )][DBLP]


  41. Optimal universal graphs with deterministic embedding. [Citation Graph (, )][DBLP]


  42. Fast and reliable reconstruction of phylogenetic trees with very short edges. [Citation Graph (, )][DBLP]


  43. Trace reconstruction with constant deletion probability and related results. [Citation Graph (, )][DBLP]


  44. Improved string reconstruction over insertion-deletion channels. [Citation Graph (, )][DBLP]


  45. Dimension augmentation and combinatorial criteria for efficient error-resistant DNA self-assembly. [Citation Graph (, )][DBLP]


  46. Approximating general metric distances between a pattern and a text. [Citation Graph (, )][DBLP]


  47. A near-linear time algorithm for computing replacement paths in planar directed graphs. [Citation Graph (, )][DBLP]


  48. Bounded-leg distance and reachability oracles. [Citation Graph (, )][DBLP]


  49. A nearly linear time algorithm for the half integral disjoint paths packing. [Citation Graph (, )][DBLP]


  50. Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. [Citation Graph (, )][DBLP]


  51. Nondecreasing paths in a weighted graph or: how to optimally read a train schedule. [Citation Graph (, )][DBLP]


  52. Broadcast scheduling: algorithms and complexity. [Citation Graph (, )][DBLP]


  53. Graph balancing: a special case of scheduling unrelated parallel machines. [Citation Graph (, )][DBLP]


  54. Non-clairvoyant scheduling with precedence constraints. [Citation Graph (, )][DBLP]


  55. Provably good multicore cache performance for divide-and-conquer algorithms. [Citation Graph (, )][DBLP]


  56. Balls and bins with structure: balanced allocations on hypergraphs. [Citation Graph (, )][DBLP]


  57. Arc-disjoint in-trees in directed graphs. [Citation Graph (, )][DBLP]


  58. Finding one tight cycle. [Citation Graph (, )][DBLP]


  59. Set connectivity problems in undirected graphs and the directed Steiner network problem. [Citation Graph (, )][DBLP]


  60. Matroid intersection, pointer chasing, and Young's seminormal representation of Sn. [Citation Graph (, )][DBLP]


  61. Iterated rounding algorithms for the smallest k-edge connected spanning subgraph. [Citation Graph (, )][DBLP]


  62. Shuffling cards, adding numbers, and symmetric functions. [Citation Graph (, )][DBLP]


  63. On the bichromatic k-set problem. [Citation Graph (, )][DBLP]


  64. Geodesic Delaunay triangulation and witness complex in the plane. [Citation Graph (, )][DBLP]


  65. Minimum weight convex Steiner partitions. [Citation Graph (, )][DBLP]


  66. Improved algorithms for fully dynamic geometric spanners and geometric routing. [Citation Graph (, )][DBLP]


  67. On the connectivity of dynamic random geometric graphs. [Citation Graph (, )][DBLP]


  68. Improved algorithmic versions of the Lovász Local Lemma. [Citation Graph (, )][DBLP]


  69. L(2, 1)-labelling of graphs. [Citation Graph (, )][DBLP]


  70. Catalan structures and dynamic programming in H-minor-free graphs. [Citation Graph (, )][DBLP]


  71. Computing excluded minors. [Citation Graph (, )][DBLP]


  72. An algorithm for improving graph partitions. [Citation Graph (, )][DBLP]


  73. Improved algorithms for orienteering and related problems. [Citation Graph (, )][DBLP]


  74. Approximation algorithms for labeling hierarchical taxonomies. [Citation Graph (, )][DBLP]


  75. Fast approximation of the permanent for very dense problems. [Citation Graph (, )][DBLP]


  76. Approximating TSP on metrics with bounded global growth. [Citation Graph (, )][DBLP]


  77. Fully polynomial time approximation schemes for stochastic dynamic programs. [Citation Graph (, )][DBLP]


  78. On distributing symmetric streaming computations. [Citation Graph (, )][DBLP]


  79. Tight lower bounds for selection in randomly ordered streams. [Citation Graph (, )][DBLP]


  80. On distance to monotonicity and longest increasing subsequence of a data stream. [Citation Graph (, )][DBLP]


  81. Declaring independence via the sketching of sketches. [Citation Graph (, )][DBLP]


  82. Why simple hash functions work: exploiting the entropy in a data stream. [Citation Graph (, )][DBLP]


  83. Maximum overhang. [Citation Graph (, )][DBLP]


  84. Deterministic random walks on regular trees. [Citation Graph (, )][DBLP]


  85. Quasirandom rumor spreading. [Citation Graph (, )][DBLP]


  86. Universality of random graphs. [Citation Graph (, )][DBLP]


  87. The effect of induced subgraphs on quasi-randomness. [Citation Graph (, )][DBLP]


  88. Clustering for metric and non-metric distance measures. [Citation Graph (, )][DBLP]


  89. Metric clustering via consistent labeling. [Citation Graph (, )][DBLP]


  90. On clustering to minimize the sum of radii. [Citation Graph (, )][DBLP]


  91. A constant factor approximation algorithm for k-median clustering with outliers. [Citation Graph (, )][DBLP]


  92. Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimension. [Citation Graph (, )][DBLP]


  93. The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond. [Citation Graph (, )][DBLP]


  94. Designing networks with good equilibria. [Citation Graph (, )][DBLP]


  95. Ascending auctions for integral (poly)matroids with concave nondecreasing separable values. [Citation Graph (, )][DBLP]


  96. Fast algorithms for finding proper strategies in game trees. [Citation Graph (, )][DBLP]


  97. Incentive compatible regression learning. [Citation Graph (, )][DBLP]


  98. Space-efficient dynamic orthogonal point location, segment intersection, and range reporting. [Citation Graph (, )][DBLP]


  99. In-place 2-d nearest neighbor search. [Citation Graph (, )][DBLP]


  100. Distribution-sensitive point location in convex subdivisions. [Citation Graph (, )][DBLP]


  101. Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. [Citation Graph (, )][DBLP]


  102. Sampling algorithms and coresets for ℓp regression. [Citation Graph (, )][DBLP]


  103. Stochastic analyses for online combinatorial optimization problems. [Citation Graph (, )][DBLP]


  104. Online make-to-order joint replenishment model: primal dual competitive algorithms. [Citation Graph (, )][DBLP]


  105. Parallel monotonicity reconstruction. [Citation Graph (, )][DBLP]


  106. Better bounds for online load balancing on unrelated machines. [Citation Graph (, )][DBLP]


  107. Online budgeted matching in random input models with applications to Adwords. [Citation Graph (, )][DBLP]


  108. Computational advertising. [Citation Graph (, )][DBLP]


  109. Linked decompositions of networks and the power of choice in Polya urns. [Citation Graph (, )][DBLP]


  110. A local algorithm for finding dense subgraphs. [Citation Graph (, )][DBLP]


  111. PageRank and the random surfer model. [Citation Graph (, )][DBLP]


  112. Charity auctions on social networks. [Citation Graph (, )][DBLP]


  113. On the approximability of influence in social networks. [Citation Graph (, )][DBLP]


  114. Fast asynchronous byzantine agreement and leader election with full information. [Citation Graph (, )][DBLP]


  115. Unconditionally reliable message transmission in directed networks. [Citation Graph (, )][DBLP]


  116. A tight lower bound for parity in noisy communication networks. [Citation Graph (, )][DBLP]


  117. Ranged hash functions and the price of churn. [Citation Graph (, )][DBLP]


  118. Algorithms for distributed functional monitoring. [Citation Graph (, )][DBLP]


  119. Real-time indexing over fixed finite alphabets. [Citation Graph (, )][DBLP]


  120. Finding an optimal tree searching strategy in linear time. [Citation Graph (, )][DBLP]


  121. Dynamic optimality for skip lists and B-trees. [Citation Graph (, )][DBLP]


  122. Splay trees, Davenport-Schinzel sequences, and the deque conjecture. [Citation Graph (, )][DBLP]


  123. Fully dynamic algorithm for graph spanners with poly-logarithmic update time. [Citation Graph (, )][DBLP]


  124. SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems. [Citation Graph (, )][DBLP]


  125. Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities. [Citation Graph (, )][DBLP]


  126. Lower-bounded facility location. [Citation Graph (, )][DBLP]


  127. A plant location guide for the unsure. [Citation Graph (, )][DBLP]


  128. Approximating connected facility location problems via random facility sampling and core detouring. [Citation Graph (, )][DBLP]


  129. The hiring problem and Lake Wobegon strategies. [Citation Graph (, )][DBLP]


  130. Weak ε-nets and interval chains. [Citation Graph (, )][DBLP]


  131. Robust cost colorings. [Citation Graph (, )][DBLP]


  132. Comparing the strength of query types in property testing: the case of testing k-colorability. [Citation Graph (, )][DBLP]


  133. Sampling stable marriages: why spouse-swapping won't work. [Citation Graph (, )][DBLP]


  134. On stars and Steiner stars. [Citation Graph (, )][DBLP]


  135. Cutting cycles of rods in space: hardness and approximation. [Citation Graph (, )][DBLP]


  136. Empty-ellipse graphs. [Citation Graph (, )][DBLP]


  137. Recognizing partial cubes in quadratic time. [Citation Graph (, )][DBLP]


  138. Approximating geometric coverage problems. [Citation Graph (, )][DBLP]

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002