The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations. [Citation Graph (, )][DBLP]

  2. Perfect matchings via uniform sampling in regular bipartite graphs. [Citation Graph (, )][DBLP]

  3. The ratio index for budgeted learning, with applications. [Citation Graph (, )][DBLP]

  4. Approximation algorithms for restless bandit problems. [Citation Graph (, )][DBLP]

  5. Better algorithms for benign bandits. [Citation Graph (, )][DBLP]

  6. The cover time of random geometric graphs. [Citation Graph (, )][DBLP]

  7. The complexity of simulating Brownian Motion. [Citation Graph (, )][DBLP]

  8. Sorting by placement and shift. [Citation Graph (, )][DBLP]

  9. Sampling biased lattice configurations using exponential metrics. [Citation Graph (, )][DBLP]

  10. On the hitting times of quantum versus random walks. [Citation Graph (, )][DBLP]

  11. Efficient algorithms for the 2-gathering problem. [Citation Graph (, )][DBLP]

  12. Asymptotically optimal frugal colouring. [Citation Graph (, )][DBLP]

  13. A quadratic kernel for feedback vertex set. [Citation Graph (, )][DBLP]

  14. Coloring triangle-free graphs on surfaces. [Citation Graph (, )][DBLP]

  15. (Un)expected behavior of digital search tree profile. [Citation Graph (, )][DBLP]

  16. Combinatorial stochastic processes and nonparametric Bayesian modeling. [Citation Graph (, )][DBLP]

  17. Comparison-based time-space lower bounds for selection. [Citation Graph (, )][DBLP]

  18. Linear-time algorithms for geometric graphs with sublinearly many crossings. [Citation Graph (, )][DBLP]

  19. Self-overlapping curves revisited. [Citation Graph (, )][DBLP]

  20. Line transversals of convex polyhedra in R3. [Citation Graph (, )][DBLP]

  21. Optimal halfspace range reporting in three dimensions. [Citation Graph (, )][DBLP]

  22. Optimality of belief propagation for random assignment problem. [Citation Graph (, )][DBLP]

  23. Termination criteria for solving concurrent safety and reachability games. [Citation Graph (, )][DBLP]

  24. An efficient sparse regularity concept. [Citation Graph (, )][DBLP]

  25. Almost all hypergraphs without Fano planes are bipartite. [Citation Graph (, )][DBLP]

  26. Hypergraph regularity and quasi-randomness. [Citation Graph (, )][DBLP]

  27. Shortest paths in directed planar graphs with negative lengths: a linear-space O(n log2 n)-time algorithm. [Citation Graph (, )][DBLP]

  28. A near-linear time algorithm for constructing a cactus representation of minimum cuts. [Citation Graph (, )][DBLP]

  29. Testing halfspaces. [Citation Graph (, )][DBLP]

  30. Fast edge orientation for unweighted graphs. [Citation Graph (, )][DBLP]

  31. A unified approach to distance-two colouring of planar graphs. [Citation Graph (, )][DBLP]

  32. Approximate Euclidean shortest paths amid convex obstacles. [Citation Graph (, )][DBLP]

  33. Approximate line nearest neighbor in high dimensions. [Citation Graph (, )][DBLP]

  34. Decomposition of multiple coverings into more parts. [Citation Graph (, )][DBLP]

  35. On stars and Steiner stars: II. [Citation Graph (, )][DBLP]

  36. Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design. [Citation Graph (, )][DBLP]

  37. Computing the nucleolus of weighted voting games. [Citation Graph (, )][DBLP]

  38. High rate fingerprinting codes and the fingerprinting capacity. [Citation Graph (, )][DBLP]

  39. On the power of two, three and four probes. [Citation Graph (, )][DBLP]

  40. Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures. [Citation Graph (, )][DBLP]

  41. 3-bit dictator testing: 1 vs. 5/8. [Citation Graph (, )][DBLP]

  42. Inserting a vertex into a planar graph. [Citation Graph (, )][DBLP]

  43. Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths. [Citation Graph (, )][DBLP]

  44. Sorting and selection in posets. [Citation Graph (, )][DBLP]

  45. Finding duplicates in a data stream. [Citation Graph (, )][DBLP]

  46. Compressed counting. [Citation Graph (, )][DBLP]

  47. Natural algorithms. [Citation Graph (, )][DBLP]

  48. Maximal biconnected subgraphs of random planar graphs. [Citation Graph (, )][DBLP]

  49. Approximate shared-memory counting despite a strong adversary. [Citation Graph (, )][DBLP]

  50. On smoothed k-CNF formulas and the Walksat algorithm. [Citation Graph (, )][DBLP]

  51. Improved smoothed analysis of the k-means method. [Citation Graph (, )][DBLP]

  52. Pairing heaps with O(log log n) decrease cost. [Citation Graph (, )][DBLP]

  53. A simpler implementation and analysis of Chazelle's soft heaps. [Citation Graph (, )][DBLP]

  54. Biased range trees. [Citation Graph (, )][DBLP]

  55. The geometry of binary search trees. [Citation Graph (, )][DBLP]

  56. Dual-failure distance and connectivity oracles. [Citation Graph (, )][DBLP]

  57. On the maximum quadratic assignment problem. [Citation Graph (, )][DBLP]

  58. Towards computing the Grothendieck constant. [Citation Graph (, )][DBLP]

  59. Approximating submodular functions everywhere. [Citation Graph (, )][DBLP]

  60. Maximizing submodular set functions subject to multiple linear constraints. [Citation Graph (, )][DBLP]

  61. Combinatorial algorithms for wireless information flow. [Citation Graph (, )][DBLP]

  62. Probability, algorithms and complexity. [Citation Graph (, )][DBLP]

  63. Generating random graphs with large girth. [Citation Graph (, )][DBLP]

  64. Expanders via random spanning trees. [Citation Graph (, )][DBLP]

  65. The extended k-tree algorithm. [Citation Graph (, )][DBLP]

  66. Sequential cavity method for computing limits of the log-partition function for lattice models. [Citation Graph (, )][DBLP]

  67. A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. [Citation Graph (, )][DBLP]

  68. Finding shortest contractible and shortest separating cycles in embedded graphs. [Citation Graph (, )][DBLP]

  69. Cell probe lower bounds for succinct data structures. [Citation Graph (, )][DBLP]

  70. Succinct geometric indexes supporting point location queries. [Citation Graph (, )][DBLP]

  71. Exact algorithms for partial curve matching via the Fréchet distance. [Citation Graph (, )][DBLP]

  72. String hashing for linear probing. [Citation Graph (, )][DBLP]

  73. Parameterized approximation scheme for the multiple knapsack problem. [Citation Graph (, )][DBLP]

  74. Improved approximation algorithms for scheduling with fixed jobs. [Citation Graph (, )][DBLP]

  75. Scalably scheduling processes with arbitrary speedup curves. [Citation Graph (, )][DBLP]

  76. Speed scaling with an arbitrary power function. [Citation Graph (, )][DBLP]

  77. A logarithmic approximation for unsplittable flow on line graphs. [Citation Graph (, )][DBLP]

  78. On the complexity of Nash equilibria of action-graph games. [Citation Graph (, )][DBLP]

  79. How hard is it to approximate the best Nash equilibrium? [Citation Graph (, )][DBLP]

  80. Improved equilibria via public service advertising. [Citation Graph (, )][DBLP]

  81. Stepwise randomized combinatorial auctions achieve revenue monotonicity. [Citation Graph (, )][DBLP]

  82. Equilibria of atomic flow games are not unique. [Citation Graph (, )][DBLP]

  83. A generic top-down dynamic-programming approach to prefix-free coding. [Citation Graph (, )][DBLP]

  84. On the bit-complexity of Lempel-Ziv compression. [Citation Graph (, )][DBLP]

  85. From coding theory to efficient pattern matching. [Citation Graph (, )][DBLP]

  86. Monotone minimal perfect hashing: searching a sorted table with O(1) accesses. [Citation Graph (, )][DBLP]

  87. On risks of using cuckoo hashing with simple universal hash classes. [Citation Graph (, )][DBLP]

  88. Assignment problem in content distribution networks: unsplittable hard-capacitated facility location. [Citation Graph (, )][DBLP]

  89. Efficient coordination mechanisms for unrelated machine scheduling. [Citation Graph (, )][DBLP]

  90. Clique-width: on the price of generality. [Citation Graph (, )][DBLP]

  91. Reasoning about online algorithms with weighted automata. [Citation Graph (, )][DBLP]

  92. Appointment scheduling with discrete random durations. [Citation Graph (, )][DBLP]

  93. Hardness of embedding simplicial complexes in Rd. [Citation Graph (, )][DBLP]

  94. Overcoming the l1 non-embeddability barrier: algorithms for product metrics. [Citation Graph (, )][DBLP]

  95. On low dimensional local embeddings. [Citation Graph (, )][DBLP]

  96. The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite. [Citation Graph (, )][DBLP]

  97. Maximum independent set of rectangles. [Citation Graph (, )][DBLP]

  98. Approximating fractional hypertree width. [Citation Graph (, )][DBLP]

  99. An almost O(log k)-approximation for k-connected subgraphs. [Citation Graph (, )][DBLP]

  100. Improved approximating algorithms for Directed Steiner Forest. [Citation Graph (, )][DBLP]

  101. Transitive-closure spanners. [Citation Graph (, )][DBLP]

  102. Partitioning graphs into balanced components. [Citation Graph (, )][DBLP]

  103. Efficient algorithms on sets of permutations, dominance, and real-weighted APSP. [Citation Graph (, )][DBLP]

  104. Discounted deterministic Markov decision processes and discounted all-pairs shortest paths. [Citation Graph (, )][DBLP]

  105. An improved approximation algorithm for the column subset selection problem. [Citation Graph (, )][DBLP]

  106. Column subset selection, matrix factorization, and eigenvalue optimization. [Citation Graph (, )][DBLP]

  107. Loopless generation of multiset permutations using a constant number of variables by prefix shifts. [Citation Graph (, )][DBLP]

  108. The unreasonable effectiveness of martingales. [Citation Graph (, )][DBLP]

  109. Dimension detection via slivers. [Citation Graph (, )][DBLP]

  110. Persistent homology for kernels, images, and cokernels. [Citation Graph (, )][DBLP]

  111. Analysis of scalar fields over point cloud data. [Citation Graph (, )][DBLP]

  112. Constructing Laplace operator from point clouds in Rd. [Citation Graph (, )][DBLP]

  113. Size complexity of volume meshes vs. surface meshes. [Citation Graph (, )][DBLP]

  114. Packing multiway cuts in capacitated graphs. [Citation Graph (, )][DBLP]

  115. On the approximability of Dodgson and Young elections. [Citation Graph (, )][DBLP]

  116. Approximate clustering without the approximation. [Citation Graph (, )][DBLP]

  117. Robust PCA and clustering in noisy mixtures. [Citation Graph (, )][DBLP]

  118. Coresets and approximate clustering for Bregman divergences. [Citation Graph (, )][DBLP]

  119. Multi-dimensional online tracking. [Citation Graph (, )][DBLP]

  120. A new approach to incremental topological ordering. [Citation Graph (, )][DBLP]

  121. Online scheduling to minimize the maximum delay factor. [Citation Graph (, )][DBLP]

  122. Collecting weighted items from a dynamic queue. [Citation Graph (, )][DBLP]

  123. Paging and list update under bijective analysis. [Citation Graph (, )][DBLP]

  124. Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. [Citation Graph (, )][DBLP]

  125. List-color-critical graphs on a fixed surface. [Citation Graph (, )][DBLP]

  126. Additive approximation algorithms for list-coloring minor-closed class of graphs. [Citation Graph (, )][DBLP]

  127. Three-coloring triangle-free planar graphs in linear time. [Citation Graph (, )][DBLP]

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

  129. The uniform hardcore lemma via approximate Bregman projections. [Citation Graph (, )][DBLP]

  130. Improved approximation bound for quadratic optimization problems with orthogonality constraints. [Citation Graph (, )][DBLP]

  131. On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. [Citation Graph (, )][DBLP]

  132. On the relative strength of split, triangle and quadrilateral cuts. [Citation Graph (, )][DBLP]

  133. A simple combinatorial algorithm for submodular function minimization. [Citation Graph (, )][DBLP]

  134. Weighted flow time does not admit O(1)-competitive algorithms. [Citation Graph (, )][DBLP]

  135. Secretary problems: weights and discounts. [Citation Graph (, )][DBLP]

  136. Stream sampling for variance-optimal estimation of subset sums. [Citation Graph (, )][DBLP]

  137. An online mechanism for ad slot reservations with cancellations. [Citation Graph (, )][DBLP]

  138. Online story scheduling in web advertising. [Citation Graph (, )][DBLP]

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002