The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. On the Optimality of Spiral Search. [Citation Graph (, )][DBLP]

  2. An Improved Competitive Algorithm for Reordering Buffer Management. [Citation Graph (, )][DBLP]

  3. How to Meet Asynchronously (Almost) Everywhere. [Citation Graph (, )][DBLP]

  4. A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model. [Citation Graph (, )][DBLP]

  5. Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. [Citation Graph (, )][DBLP]

  6. Testing Monotone Continuous Distributions on High-dimensional Real Cubes. [Citation Graph (, )][DBLP]

  7. Property Testing and Parameter Testing for Permutations. [Citation Graph (, )][DBLP]

  8. Near-Optimal Sublinear Time Algorithms for Ulam Distance. [Citation Graph (, )][DBLP]

  9. Lower Bounds for Testing Triangle-freeness in Boolean Functions. [Citation Graph (, )][DBLP]

  10. Counting Stars and Other Small Subgraphs in Sublinear Time. [Citation Graph (, )][DBLP]

  11. Cell-Probe Lower Bounds for Succinct Partial Sums. [Citation Graph (, )][DBLP]

  12. On the Cell Probe Complexity of Dynamic Membership. [Citation Graph (, )][DBLP]

  13. Fully-Functional Succinct Trees. [Citation Graph (, )][DBLP]

  14. Data Structures for Range Minimum Queries in Multidimensional Arrays. [Citation Graph (, )][DBLP]

  15. Counting Inversions, Offline Orthogonal Range Counting, and Related Problems. [Citation Graph (, )][DBLP]

  16. Differential Privacy in New Settings. [Citation Graph (, )][DBLP]

  17. Lower Bounds for Edit Distance and Product Metrics via Poincaré-Type Inequalities. [Citation Graph (, )][DBLP]

  18. Genus and the Geometry of the Cut Graph. [Citation Graph (, )][DBLP]

  19. Testing Planarity of Partially Embedded Graphs. [Citation Graph (, )][DBLP]

  20. Inapproximability for Planar Embedding Problems. [Citation Graph (, )][DBLP]

  21. Towards a Calculus for Non-Linear Spectral Gaps. [Citation Graph (, )][DBLP]

  22. A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics. [Citation Graph (, )][DBLP]

  23. PTAS for Maximum Weight Independent Set Problem with Random Weights in Bounded Degree Graphs. [Citation Graph (, )][DBLP]

  24. Belief Propagation for Min-cost Network Flow: Convergence & Correctness. [Citation Graph (, )][DBLP]

  25. Finding the Jaccard Median. [Citation Graph (, )][DBLP]

  26. The Focus of Attention Problem. [Citation Graph (, )][DBLP]

  27. Recognizing a Totally Odd K4-subdivision, Parity 2-disjoint Rooted Paths and a Parity Cycle Through Specified Elements. [Citation Graph (, )][DBLP]

  28. Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs. [Citation Graph (, )][DBLP]

  29. The Edge Disjoint Paths Problem in Eulerian Graphs and 4-edge-connected Graphs. [Citation Graph (, )][DBLP]

  30. On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic. [Citation Graph (, )][DBLP]

  31. An (almost) Linear Time Algorithm for Odd Cyles Transversal. [Citation Graph (, )][DBLP]

  32. An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem. [Citation Graph (, )][DBLP]

  33. A Quasi-polynomial Time Approximation Scheme for Euclidean Capacitated Vehicle Routing. [Citation Graph (, )][DBLP]

  34. Region Growing for Multi-Route Cuts. [Citation Graph (, )][DBLP]

  35. Asymmetric Traveling Salesman Path and Directed Latency Problems. [Citation Graph (, )][DBLP]

  36. Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls. [Citation Graph (, )][DBLP]

  37. Quantum Algorithms for Highly Non-Linear Boolean Functions. [Citation Graph (, )][DBLP]

  38. Compact Ancestry Labeling Schemes for XML Trees. [Citation Graph (, )][DBLP]

  39. Generating a d-dimensional Linear Subspace Efficiently. [Citation Graph (, )][DBLP]

  40. Algorithms for Ray Class Groups and Hilbert Class Fields. [Citation Graph (, )][DBLP]

  41. A Space-Time Tradeoff for Permutation Problems. [Citation Graph (, )][DBLP]

  42. Algorithmic Lower Bounds for Problems Parameterized with Clique-Width. [Citation Graph (, )][DBLP]

  43. Bidimensionality and Kernels. [Citation Graph (, )][DBLP]

  44. Solving MAX-r-SAT Above a Tight Lower Bound. [Citation Graph (, )][DBLP]

  45. Inapproximability for VCG-Based Combinatorial Auctions. [Citation Graph (, )][DBLP]

  46. Price of Anarchy for Greedy Auctions. [Citation Graph (, )][DBLP]

  47. Incentive Compatible Budget Elicitation in Multi-unit Auctions. [Citation Graph (, )][DBLP]

  48. Utilitarian Mechanism Design for Multi-Objective Optimization. [Citation Graph (, )][DBLP]

  49. Pricing Randomized Allocations. [Citation Graph (, )][DBLP]

  50. Universal epsilon-approximators for Integrals. [Citation Graph (, )][DBLP]

  51. Optimally Reconstructing Weighted Graphs Using Queries. [Citation Graph (, )][DBLP]

  52. Online Learning with Queries. [Citation Graph (, )][DBLP]

  53. Coresets and Sketches for High Dimensional Subspace Approximation Problems. [Citation Graph (, )][DBLP]

  54. Convergence, Stability, and Discrete Approximation of Laplace Spectra. [Citation Graph (, )][DBLP]

  55. Sharp Kernel Clustering Algorithms and Their Associated Grothendieck Inequalities. [Citation Graph (, )][DBLP]

  56. Fast SDP Algorithms for Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]

  57. Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital Communications. [Citation Graph (, )][DBLP]

  58. Correlation Clustering with Noisy Input. [Citation Graph (, )][DBLP]

  59. A Polynomial Time Approximation Scheme for k-Consensus Clustering. [Citation Graph (, )][DBLP]

  60. Google's Auction for TV Ads. [Citation Graph (, )][DBLP]

  61. A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General Graphs. [Citation Graph (, )][DBLP]

  62. Solving the Replacement Paths Problem for Planar Directed Graphs in O(n log n) Time. [Citation Graph (, )][DBLP]

  63. Bounding Variance and Expectation of Longest Path Lengths in DAGs. [Citation Graph (, )][DBLP]

  64. Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. [Citation Graph (, )][DBLP]

  65. Maximum Flows and Parametric Shortest Paths in Planar Graphs. [Citation Graph (, )][DBLP]

  66. On the Equilibria of Alternating Move Games. [Citation Graph (, )][DBLP]

  67. Monotonicity in Bargaining Networks. [Citation Graph (, )][DBLP]

  68. Sharp Dichotomies for Regret Minimization in Metric Spaces. [Citation Graph (, )][DBLP]

  69. Solving Simple Stochastic Tail Games. [Citation Graph (, )][DBLP]

  70. One-Counter Markov Decision Processes. [Citation Graph (, )][DBLP]

  71. On Nonlinear Forbidden 0-1 Matrices: A Refutation of a Füredi-Hajnal Conjecture. [Citation Graph (, )][DBLP]

  72. An Improved Construction of Progression-Free Sets. [Citation Graph (, )][DBLP]

  73. Geometric Optimization and Sums of Algebraic Functions. [Citation Graph (, )][DBLP]

  74. Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface. [Citation Graph (, )][DBLP]

  75. How Far Can You Reach? [Citation Graph (, )][DBLP]

  76. A Model of Computation for MapReduce. [Citation Graph (, )][DBLP]

  77. Synchrony and Asynchrony in Neural Networks. [Citation Graph (, )][DBLP]

  78. Distributed Agreement with Optimal Communication Complexity. [Citation Graph (, )][DBLP]

  79. How Good is the Chord Algorithm?. [Citation Graph (, )][DBLP]

  80. Deterministic Algorithms for the Lovász Local Lemma. [Citation Graph (, )][DBLP]

  81. A Deterministic Truthful PTAS for Scheduling Related Machines. [Citation Graph (, )][DBLP]

  82. A Fourier Space Algorithm for Solving Quadratic Assignment Problems. [Citation Graph (, )][DBLP]

  83. EDF-schedulability of Synchronous Periodic Task Systems is coNP-hard. [Citation Graph (, )][DBLP]

  84. Reconstructing Approximate Phylogenetic Trees from Quartet Samples. [Citation Graph (, )][DBLP]

  85. Shape Replication through Self-Assembly and RNase Enzymes. [Citation Graph (, )][DBLP]

  86. On the Possibility of Faster SAT Algorithms. [Citation Graph (, )][DBLP]

  87. Paired Approximation Problems and Incompatible Inapproximabilities. [Citation Graph (, )][DBLP]

  88. Correlation Robust Stochastic Optimization. [Citation Graph (, )][DBLP]

  89. Approximability of Robust Network Design. [Citation Graph (, )][DBLP]

  90. Differentially Private Combinatorial Optimization. [Citation Graph (, )][DBLP]

  91. Efficiently Decodable Non-adaptive Group Testing. [Citation Graph (, )][DBLP]

  92. 1-Pass Relative-Error Lp-Sampling with Applications. [Citation Graph (, )][DBLP]

  93. On the Exact Space Complexity of Sketching and Streaming Small Norms. [Citation Graph (, )][DBLP]

  94. A Locality-Sensitive Hash for Real Vectors. [Citation Graph (, )][DBLP]

  95. Lower Bounds for Sparse Recovery. [Citation Graph (, )][DBLP]

  96. Flow-Cut Gaps for Integer and Fractional Multiflows. [Citation Graph (, )][DBLP]

  97. A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks. [Citation Graph (, )][DBLP]

  98. Testing Additive Integrality Gaps. [Citation Graph (, )][DBLP]

  99. Classified Stable Matching. [Citation Graph (, )][DBLP]

  100. Basis Reduction and the Complexity of Brand-and-Bound. [Citation Graph (, )][DBLP]

  101. Randomized Shellsort: A Simple Oblivious Sorting Algorithm. [Citation Graph (, )][DBLP]

  102. Data-Specific Analysis of String Sorting. [Citation Graph (, )][DBLP]

  103. Fast Distance Multiplication of Unit-Monge Matrices. [Citation Graph (, )][DBLP]

  104. Regular Expression Matching with Multi-Strings and Intervals. [Citation Graph (, )][DBLP]

  105. Road Network Reconstruction for Organizing Paths. [Citation Graph (, )][DBLP]

  106. The Power of Convex Relaxation: The Surprising Stories of Matrix Completion and Compressed Sensing. [Citation Graph (, )][DBLP]

  107. An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling. [Citation Graph (, )][DBLP]

  108. Resource Minimization for Fire Containment. [Citation Graph (, )][DBLP]

  109. Algorithms and Complexity for Periodic Real-Time Scheduling. [Citation Graph (, )][DBLP]

  110. Energy Efficient Scheduling via Partial Shutdown. [Citation Graph (, )][DBLP]

  111. SRPT is 1.86-Competitive for Completion Time Scheduling. [Citation Graph (, )][DBLP]

  112. The Rank of Diluted Random Graphs. [Citation Graph (, )][DBLP]

  113. The Scaling Window for a Random Graph with a Given Degree Sequence. [Citation Graph (, )][DBLP]

  114. Efficient Broadcast on Random Geometric Graphs. [Citation Graph (, )][DBLP]

  115. Speeding Up Random Walks with Neighborhood Exploration. [Citation Graph (, )][DBLP]

  116. Vertices of Degree k in Random Maps. [Citation Graph (, )][DBLP]

  117. Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. [Citation Graph (, )][DBLP]

  118. Applications of Forbidden 0-1 Matrices to Search Tree and Path Compression-Based Data Structures. [Citation Graph (, )][DBLP]

  119. Faster Exponential Time Algorithms for the Shortest Vector Problem. [Citation Graph (, )][DBLP]

  120. Streaming Algorithms for Extent Problems in High Dimensions. [Citation Graph (, )][DBLP]

  121. Deletion Without Rebalancing in Balanced Binary Trees. [Citation Graph (, )][DBLP]

  122. On Linear and Semidefinite Programming Relaxations for Hypergraph Matching. [Citation Graph (, )][DBLP]

  123. Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph. [Citation Graph (, )][DBLP]

  124. Tree Embeddings for Two-Edge-Connected Network Design. [Citation Graph (, )][DBLP]

  125. A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover. [Citation Graph (, )][DBLP]

  126. Self-improving Algorithms for Convex Hulls. [Citation Graph (, )][DBLP]

  127. The Forest Hiding Problem. [Citation Graph (, )][DBLP]

  128. Terrain Guarding is NP-Hard. [Citation Graph (, )][DBLP]

  129. Hardness Results for Homology Localization. [Citation Graph (, )][DBLP]

  130. Orthogonal Ham-Sandwich Theorem in R3. [Citation Graph (, )][DBLP]

  131. The (1 + beta)-Choice Process and Weighted Balls-into-Bins. [Citation Graph (, )][DBLP]

  132. Quasirandom Load Balancing. [Citation Graph (, )][DBLP]

  133. Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies. [Citation Graph (, )][DBLP]

  134. Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees. [Citation Graph (, )][DBLP]

  135. Rumour Spreading and Graph Conductance. [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