The SCEAS System
Navigation Menu

Conferences in DBLP

Symposium on Discrete Algorithms (SODA) (soda)
1998 (conf/soda/98)

  1. Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman
    Analysis of a Local Search Heuristic for Facility Location Problems. [Citation Graph (1, 0)][DBLP]
    SODA, 1998, pp:1-10 [Conf]
  2. Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber
    Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:11-20 [Conf]
  3. Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang
    A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:21-32 [Conf]
  4. Sanjeev Arora, Michelangelo Grigni, David R. Karger, Philip N. Klein, Andrzej Woloszyn
    A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:33-41 [Conf]
  5. Michael B. Monagan, Roger Margot
    Computing Univariate GCDs over Number Fields. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:42-49 [Conf]
  6. Ming-Deh A. Huang, Yiu-Chung Wong
    Extended Hilbert Irreducibility and its Applications. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:50-58 [Conf]
  7. Hal Wasserman
    Reconstructing Randomly Sampled Multivariate Polynomials from Highly Noisy Data. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:59-67 [Conf]
  8. Victor Y. Pan
    Approximate Polynomials Gcds, Padé Approximation, Polynomial Zeros and Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:68-77 [Conf]
  9. Marek Chrobak, John Noga
    LRU is Better than FIFO. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:78-81 [Conf]
  10. Neal E. Young
    On-Line File Caching. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:82-86 [Conf]
  11. Marek Chrobak, John Noga
    Competive Algorithms for Multilevel Caching and Relaxed List Update (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:87-96 [Conf]
  12. Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin
    Online Throughput-Competitive Algorithm for Multicast Routing and Admission Control. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:97-106 [Conf]
  13. Pankaj K. Agarwal, Jeff Erickson, Leonidas J. Guibas
    Kinetic Binary Space Partitions for Intersecting Segments and Disjoint Triangles (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    SODA, 1998, pp:107-116 [Conf]
  14. Pankaj K. Agarwal, Lars Arge, T. M. Murali, Kasturi R. Varadarajan, Jeffrey Scott Vitter
    I/O-Efficient Algorithms for Contour-line Extraction and Planar Graph Blocking (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:117-126 [Conf]
  15. Subhash Suri, Philip M. Hubbard, John F. Hughes
    Collision Detection in Aspect and Scale Bounded Polyhedra. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:127-136 [Conf]
  16. Sergei Bespamyatnikh
    An Efficient Algorithm for the Three-Dimensional Diameter Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:137-146 [Conf]
  17. Lisa Fleischer
    Faster Algorithms for the Quickest Transshipment Problem with Zero Transit Times. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:147-156 [Conf]
  18. Bernd Gärtner
    Exact Arithmetic at Low Cost - A Case Study in Linear Programming. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:157-166 [Conf]
  19. Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
    A Faster Algorithm for Minimum Cost Submodular Flows. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:167-174 [Conf]
  20. Derek G. Corneil, Stephan Olariu, Lorna Stewart
    The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:175-180 [Conf]
  21. Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann
    Sparse 0-1-Matrices and Forbidden Hypergraphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:181-187 [Conf]
  22. Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon
    Fast Backtracking Principles Applied to Find New Cages. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:188-191 [Conf]
  23. Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li
    Approximation Algorithms for Directed Steiner Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:192-200 [Conf]
  24. Uri Zwick
    Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables per Constraint. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:201-210 [Conf]
  25. Satish Rao, Andréa W. Richa
    New Approximation Techniques for Some Ordering Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:211-218 [Conf]
  26. Michal Hanckowiak, Michal Karonski, Alessandro Panconesi
    On the Distributed Complexity of Computing Maximal Matchings. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:219-225 [Conf]
  27. Gilad Koren, Amihood Amir, Emanuel Dar
    The Power of Migration in Multi-Processor Scheduling of Real-Time Systems. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:226-235 [Conf]
  28. Eyal Kushilevitz, Yishay Mansour
    Computation in Noisy Radio Networks. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:236-243 [Conf]
  29. David A. Christie
    A 3/2-Approximation Algorithm for Sorting by Reversals. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:244-252 [Conf]
  30. Naveen Garg, Goran Konjevod, R. Ravi
    A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:253-259 [Conf]
  31. Sergej Fialko, Petra Mutzel
    A New Approximation Algorithm for the Planar Augmentation Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:260-269 [Conf]
  32. Michael A. Bender, Soumen Chakrabarti, S. Muthukrishnan
    Flow and Stretch Metrics for Scheduling Continuous Job Streams. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:270-279 [Conf]
  33. Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
    Optimal Augmentation to Make a Graph k-Edge-Connected and Triconnected. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:280-289 [Conf]
  34. Susanne Albers, Michael Mitzenmacher
    Average-Case Analyses of First Fit and Random Fit Bin Packing. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:290-299 [Conf]
  35. Alexandre V. Evfimievski
    A Probabilistic Algorithm for Updating Files over a Communication Link. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:300-305 [Conf]
  36. Jørgen Bang-Jensen, Harold N. Gabow, Tibor Jordán, Zoltán Szigeti
    Edge-Connectivity Augmentation with Partition Constraints. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:306-315 [Conf]
  37. Petrisor Panaite, Andrzej Pelc
    Exploring Unknown Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:316-322 [Conf]
  38. Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén
    On-line Randomized Call Control Revisited. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:323-332 [Conf]
  39. Gordon T. Wilfong, Peter Winkler
    Ring Routing and Wavelength Translation. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:333-341 [Conf]
  40. Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, Mikkel Thorup
    Direct Routing on Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:342-349 [Conf]
  41. Russ Bubley, Martin E. Dyer
    Faster Random Generation of Linear Extensions. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:350-354 [Conf]
  42. Russ Bubley, Martin E. Dyer, Catherine S. Greenhill
    Beating the 2 Delta Bound for Approximately Counting Colourings: A Computer-Assisted Proof of Rapid Mixing. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:355-363 [Conf]
  43. Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi
    Analysis of Random Processes via And-Or Tree Evaluation. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:364-373 [Conf]
  44. Paul B. Callahan
    Output-Sensitive Generation of Random Events. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:374-383 [Conf]
  45. Sanjeev Khanna, S. Muthukrishnan, Mike Paterson
    On Approximating Rectangle Tiling and Packing. [Citation Graph (2, 0)][DBLP]
    SODA, 1998, pp:384-393 [Conf]
  46. Ron Shamir, Dekel Tsur
    The Maximum Subforest Problem: Approximation and Exact Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:394-399 [Conf]
  47. Vincenzo Liberatore
    Matroid Decomposition Methods for the Set Maxima Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:400-409 [Conf]
  48. Moses Charikar, Dan Halperin, Rajeev Motwani
    The Dynamic Servers Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:410-419 [Conf]
  49. Neal E. Young
    Bounding the Diffuse Adversary. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:420-425 [Conf]
  50. Adi Avidor, Yossi Azar, Jiri Sgall
    Ancient and New Algorithms for Load Balancing in the Lp Norm. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:426-435 [Conf]
  51. Tak Wah Lam, Fung Ling Yue
    Optimal Edge Ranking of Trees in Linear Time. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:436-445 [Conf]
  52. Hisao Tamaki, Takeshi Tokuyama
    Algorithms for the Maxium Subarray Problem Based on Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:446-452 [Conf]
  53. Martin W. P. Savelsbergh, R. N. Uma, Joel Wein
    An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:453-462 [Conf]
  54. Richard Cole, Ramesh Hariharan
    Approximate String Matching: A Simpler Faster Algorithm. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:463-472 [Conf]
  55. David A. Grable, Alessandro Panconesi
    Fast Distributed Algorithms for {Brooks-Vizing} Colourings. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:473-480 [Conf]
  56. Harry Buhrman, Matthew K. Franklin, Juan A. Garay, Jaap-Henk Hoepman, John Tromp, Paul M. B. Vitányi
    Mutual Search (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:481-489 [Conf]
  57. David R. Karger
    Better Random Sampling Algorithms for Flows in Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:490-499 [Conf]
  58. András A. Benczúr, David R. Karger
    Augmenting Undirected Edge Connectivity in Õ(n2) Time. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:500-509 [Conf]
  59. Tassos Dimitriou, Russell Impagliazzo
    Go with the Winners for Graph Bisection. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:510-520 [Conf]
  60. Edward A. Hirsch
    Two New Upper Bounds for SAT. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:521-530 [Conf]
  61. Julien Clément, Philippe Flajolet, Brigitte Vallée
    The Analysis of Hybrid Trie Structures. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:531-539 [Conf]
  62. Gerth Stølting Brodal
    Finger Search Trees with Constant Insertion Time. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:540-549 [Conf]
  63. Mikkel Thorup
    Faster Deterministic Sorting and Priority Queues in Linear Space. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:550-555 [Conf]
  64. Peter Bro Miltersen
    Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:556-563 [Conf]
  65. Martin Farach, Vincenzo Liberatore
    On Local Register Allocation. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:564-573 [Conf]
  66. Hans L. Bodlaender, Jens Gustedt, Jan Arne Telle
    Linear-Time Register Allocation for a Fixed Number of Registers. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:574-583 [Conf]
  67. Chung-Piaw Teo, Jihong Ou, Kok-Choon Tan
    Multi-Item Inventory Staggering Problems: Heuristic and Bounds. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:584-593 [Conf]
  68. Noga Alon, Michael Krivelevich, Benny Sudakov
    Finding a Large Hidden Clique in a Random Graph. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:594-598 [Conf]
  69. Andreas Birkendorf, Andreas Böker, Hans-Ulrich Simon
    Learning Deterministic Finite Automata from Smallest Counterexamples. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:599-608 [Conf]
  70. Udo Adamy, Raimund Seidel
    On the Exact Worst Case Query Complexity of Planar Point Location. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:609-618 [Conf]
  71. David Eppstein
    Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:619-628 [Conf]
  72. Uwe Schwiegelshohn, Ramin Yahyapour
    Analysis of First-Come-First-Serve Parallel Job Scheduling. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:629-638 [Conf]
  73. Ashwin Nayak, Alistair Sinclair, Uri Zwick
    Spatial Codes and the Hardness of String Folding Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:639-648 [Conf]
  74. Sudipto Guha, Samir Khuller
    Greedy Strikes Back: Improved Facility Location Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:649-657 [Conf]
  75. Pankaj K. Agarwal, Cecilia Magdalena Procopiuc
    Exact and Approximation Algorithms for Clustering (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:658-667 [Conf]
  76. Jon M. Kleinberg
    Authoritative Sources in a Hyperlinked Environment. [Citation Graph (7, 0)][DBLP]
    SODA, 1998, pp:668-677 [Conf]
  77. Ari Juels, Marcus Peinado
    Hiding Cliques for Cryptographic Security. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:678-684 [Conf]
  78. Lars Arge, Octavian Procopiuc, Sridhar Ramaswamy, Torsten Suel, Jeffrey Scott Vitter
    Theory and Practice of I/O-Efficient Algorithms for Multidimensional Batched Searching Problems (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    SODA, 1998, pp:685-694 [Conf]
  79. Tatsuya Akutsu, Satoru Kuhara, Osamu Maruyama, Satoru Miyano
    Identification of Gene Regulatory Networks by Strategic Gene Disruptions and Gene Overexpressions. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:695-702 [Conf]
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