The SCEAS System
Navigation Menu

Conferences in DBLP

Symposium on Discrete Algorithms (SODA) (soda)
1996 (conf/soda/96)

  1. Sundar Vishwanathan
    An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:1-5 [Conf]
  2. Aravind Srinivasan
    An Extension of the Lovász Local Lemma, and its Applications to Integer Programming. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:6-15 [Conf]
  3. Gruia Calinescu, Cristina G. Fernandes, Ulrich Finkler, Howard J. Karloff
    A Better Approximation Algorithm for Finding Planar Subgraphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:16-25 [Conf]
  4. Ka Wong Chong, Tak Wah Lam
    Improving Biconnectivity Approximation via Local Optimization. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:26-35 [Conf]
  5. Marek Karpinski, Lawrence L. Larmore, Wojciech Rytter
    Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:36-41 [Conf]
  6. S. Muthukrishnan, Martin Müller 0002
    Time and Space Efficient Method-Lookup for Object-Oriented Programs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:42-51 [Conf]
  7. Gerth Stølting Brodal
    Worst-Case Efficient Priority Queues. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:52-58 [Conf]
  8. Mikkel Thorup
    On RAM Priority Queues. [Citation Graph (1, 0)][DBLP]
    SODA, 1996, pp:59-67 [Conf]
  9. Baruch Awerbuch, Yossi Azar, Yair Bartal
    On-line Generalized Steiner Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:68-74 [Conf]
  10. Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks
    Randomized Robot Navigation Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:75-84 [Conf]
  11. Sandy Irani, Vitus J. Leung
    Scheduling with Conflicts, and Applications to Traffic Signal Control. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:85-94 [Conf]
  12. Yair Bartal, Stefano Leonardi, Alberto Marchetti-Spaccamela, Jiri Sgall, Leen Stougie
    Multiprocessor Scheduling with Rejection. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:95-103 [Conf]
  13. Tetsuo Asano, Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama
    Polynomial-Time Solutions to Image Segmentation. [Citation Graph (3, 0)][DBLP]
    SODA, 1996, pp:104-113 [Conf]
  14. Matthew Dickerson, Daniel Scharstein
    Optimal Placement of Convex Polygons to Maximize Point Containment. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:114-121 [Conf]
  15. Pankaj K. Agarwal, Mark de Berg, Dan Halperin, Micha Sharir
    Efficient Generation of k-Directional Assembly Sequences. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:122-131 [Conf]
  16. Michael T. Goodrich
    Fixed-Dimensional Parallel Linesr Programming via epsilon-Relative-Approximations. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:132-141 [Conf]
  17. Leslie A. Hall, David B. Shmoys, Joel Wein
    Scheduling to Minimize Average Completion Time: Off-line and On-line Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:142-151 [Conf]
  18. Michel X. Goemans, Jon M. Kleinberg
    An Improved Approximation Ratio for the Minimum Latency Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:152-158 [Conf]
  19. Xiaotie Deng, Nian Gu, Tim Brecht, KaiCheng Lu
    Preemptive Scheduling of Parallel Jobs on Multiprocessors. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:159-167 [Conf]
  20. Eric Rémila
    Tiling a Figure Using a Height in a Tree. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:168-174 [Conf]
  21. Marshall W. Bern, Barry Hayes
    The Complexity of Flat Origami. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:175-183 [Conf]
  22. Marco Pellegrini
    Electrostatic Fields without Singularities: Theory and Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:184-191 [Conf]
  23. David Alberts, Giuseppe Cattaneo, Giuseppe F. Italiano
    An Empirical Study of Dynamic Graph Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:192-201 [Conf]
  24. Siu-Wing Cheng, Moon-Pun Ng
    Isomorphism Testing and Display of Symmetries in Dynamic Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:202-211 [Conf]
  25. Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
    Fully Dynamic Output Bounded Single Source Shortest Path Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:212-221 [Conf]
  26. Sanjeev Khanna, Rajeev Motwani, Randall H. Wilson
    On Certificates and Lookahead in Dynamic Graph Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:222-231 [Conf]
  27. János Komlós, Yuan Ma, Endre Szemerédi
    Matching Nuts and Bolts in O(n log n) Time (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:232-241 [Conf]
  28. Marek Piotrów
    Depth Optimal Sorting Networks Resistant to k Passive Faults. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:242-251 [Conf]
  29. Mordecai J. Golin
    Limit Theorems for Minimum-Weight Triangulations, Other Euclidean Functionals, and Probabilistic Recurrence Relations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:252-260 [Conf]
  30. Andrei Z. Broder, Alan M. Frieze, Stephen Suen, Eli Upfal
    An Efficient Algorithm for the Vertex-Disjoint Paths Problem in Random Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:261-268 [Conf]
  31. Anil Kamath, Omri Palmon, Serge A. Plotkin
    Routing and Admission Control in General Topology Networks with Poisson Arrivals. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:269-278 [Conf]
  32. Milena Mihail, David Shallcross, Nate Dean, Marco Mostrel
    A Commercial Application of Survivable Network Design: ITP/INPLANS CCS Network Topology Analyzer. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:279-287 [Conf]
  33. Adam L. Buchsbaum, Jan P. H. van Santen
    Selecting Training Inputs via Greedy Rank Covering. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:288-295 [Conf]
  34. Robert Lupton, F. Miller Maley, Neal E. Young
    Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:296-303 [Conf]
  35. Sridhar Hannenhalli, Pavel A. Pevzner
    To Cut... or Not to Cut (Applications of Comparative Physical Maps in Molecular Evolution). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:304-313 [Conf]
  36. Tandy Warnow, Donald Ringe, Ann Taylor
    Reconstructing the Evolutionary History of Natural Languages. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:314-322 [Conf]
  37. Richard Cole, Ramesh Hariharan
    An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:323-332 [Conf]
  38. Monika Rauch Henzinger, Valerie King, Tandy Warnow
    Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:333-340 [Conf]
  39. David S. Johnson, Lyle A. McGeoch, Edward E. Rothberg
    Asymptotic Experimental Analysis for the Held-Karp Traveling Salesman Bound. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:341-350 [Conf]
  40. Claire Kenyon, Yuval Rabani, Alistair Sinclair
    Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:351-358 [Conf]
  41. Claire Kenyon
    Best-Fit Bin-Packing with Random Order. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:359-364 [Conf]
  42. Richa Agarwala, Vineet Bafna, Martin Farach, Babu O. Narayanan, Mike Paterson, Mikkel Thorup
    On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:365-372 [Conf]
  43. Paolo Ferragina, Roberto Grossi
    Fast String Searching in Secondary Storage: Theoretical Developments And Experimental Results. [Citation Graph (1, 0)][DBLP]
    SODA, 1996, pp:373-382 [Conf]
  44. David R. Clark, J. Ian Munro
    Efficient Suffix Trees on Secondary Storage (extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:383-391 [Conf]
  45. Christos Levcopoulos, Drago Krznaric
    Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:392-401 [Conf]
  46. Joseph S. B. Mitchell
    Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple New Method for the Geometric k-MST Problem. [Citation Graph (1, 0)][DBLP]
    SODA, 1996, pp:402-408 [Conf]
  47. Hongyan Wang, Pankaj K. Agarwal
    Approximation Algorithms for Curvature-Constrained Shortest Paths. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:409-418 [Conf]
  48. Esther M. Arkin, Martin Held, Christopher L. Smith
    Optimization Problems Related to Zigzag Pocket Machining (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:419-428 [Conf]
  49. Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons
    RNC Algorithms for the Uniform Generation of Combinatorial Structures. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:429-437 [Conf]
  50. Shay Halperin, Uri Zwick
    Optimal randomized EREW PRAM Algorithms for Finding Spanning Forests and for other Basic Graph Connectivity Problems. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:438-447 [Conf]
  51. David Bruce Wilson, James Gary Propp
    How to Get an Exact Sample From a Generic Markov Chain and Sample a Random Spanning Tree From a Directed Graph, Both Within the Cover Time. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:448-457 [Conf]
  52. Richard M. Karp, Claire Kenyon, Orli Waarts
    Error-Resilient DNA Computation. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:458-467 [Conf]
  53. Ehud Kalai
    Games, Computers, and O.R. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:468-473 [Conf]
  54. James B. Orlin
    A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost Flows (An Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:474-481 [Conf]
  55. Satoru Iwata
    A Capacity Scaling Algorithm for Convex Cost Submodular Flows. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:482-489 [Conf]
  56. S. Thomas McCormick
    A Polynomial Algorithm for Abstract Maximum Flow. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:490-497 [Conf]
  57. László Babai, Robert Beals, Jin-yi Cai, Gábor Ivanyos, Eugene M. Luks
    Multiplicative Equations over Commuting Matrices. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:498-507 [Conf]
  58. Ming-Deh A. Huang, Ashwin J. Rao
    Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:508-517 [Conf]
  59. Victor Y. Pan
    A New Approach to Parallel Computation of Polynomial GCD and to Related Parallel Computations over Fields and Integer Rings. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:518-527 [Conf]
  60. Harold N. Gabow
    Perfect Arborescence Packing in Preflow Mincut Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:528-538 [Conf]
  61. Greg N. Frederickson, Roberto Solis-Oba
    Increasing the Weight of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:539-546 [Conf]
  62. Donald Aingworth, Chandra Chekuri, Rajeev Motwani
    Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication). [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:547-553 [Conf]
  63. Leslie Ann Goldberg, Philip D. MacKenzie
    Analysis of Practical Backoff Protocols for Contention Resolution with Multiple Servers. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:554-563 [Conf]
  64. Alain J. Mayer, Rafail Ostrovsky, Moti Yung
    Self-Stabilizing Algorithms for Synchronous Unidirectional Rings. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:564-573 [Conf]
  65. Baruch Awerbuch, Yair Bartal, Amos Fiat
    Distributed Paging for General Networks. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:574-583 [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