The SCEAS System
Navigation Menu

Conferences in DBLP

Scandinavian Workshop on Algorithm Theory (SWAT) (swat)
1992 (conf/swat/1992)

  1. Alexandros V. Gerbessiotis, Leslie G. Valiant
    Direct Bulk-Synchronous Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:1-18 [Conf]
  2. Rusins Freivalds, Carl H. Smith
    Memory Limited Inductive Inference Machines. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:19-29 [Conf]
  3. Faith E. Fich, Miroslaw Kowaluk, Krzysztof Lorys, Miroslaw Kutylowski, Prabhakar Ragde
    Retrieval of scattered information by EREW, CREW and CRCW PRAMs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:30-41 [Conf]
  4. Alexander A. Razborov
    On Small Depth Threshold Circuits. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:42-52 [Conf]
  5. Nicholas Pippenger
    An Elementary Approach to Some Analytic Asymptotics. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:53-61 [Conf]
  6. Artur Czumaj
    An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:62-72 [Conf]
  7. Guy Kortsarz, David Peleg
    Generating Sparse 2-spanners. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:73-82 [Conf]
  8. Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
    Low-Diameter Graph Decomposition is in NC. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:83-93 [Conf]
  9. Xin He
    Parallel Algorithm for Cograph Recognition with Applications. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:94-105 [Conf]
  10. Subir Kumar Ghosh, Anil Maheshwari
    Parallel Algorithms for All Minimum Link Paths and Link Center Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:106-117 [Conf]
  11. Michael Kaufmann, Jop F. Sibeyn
    Optimal Multi-Packet Routing on the Torus. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:118-129 [Conf]
  12. Maria Cristina Pinotti, Geppino Pucci
    Parallel Algorithms for Priority Queue Operations. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:130-139 [Conf]
  13. Paul F. Dietz
    Heap Construction in the Parallel Comparison Tree Model. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:140-150 [Conf]
  14. Joan Boyar, Kim S. Larsen
    Efficient Rebalancing of Chromatic Search Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:151-164 [Conf]
  15. Andreas Jakoby, Rüdiger Reischuk
    The Complexity of Scheduling Problems with Communication Delays for Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:165-177 [Conf]
  16. Fabrizio d'Amore, Vincenzo Liberatore
    The List Update Problem and the Retrieval of Sets. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:178-191 [Conf]
  17. Walter Cunto, Vicente Yriarte
    GKD-Trees: Binary Trees that Combine Multi-dimensional Data Handling, Node Size and Fringe Reorganization. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:192-211 [Conf]
  18. Sandeep Sen
    Fractional Cascading Simplified. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:212-220 [Conf]
  19. Dora Giammarresi, Giuseppe F. Italiano
    Dynamic 2- and 3-Connectivity on Planar Graphs (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:221-232 [Conf]
  20. John Hershberger, Monika Rauch, Subhash Suri
    Fully Dynamic 2-Edge-Connectivity in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:233-244 [Conf]
  21. Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, B. Shepherd
    Non-Interfering Network Flows. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:245-257 [Conf]
  22. Goos Kant, Hans L. Bodlaender
    Triangulating Planar Graphs While Minimizing the Maximum Degree. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:258-271 [Conf]
  23. Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis
    How to Draw a Series-Parallel Digraph (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:272-283 [Conf]
  24. Martin Fürer, C. R. Subramanian
    Coloring Random Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:284-291 [Conf]
  25. Ton Kloks, Hans L. Bodlaender
    Testing Superperfection of k-Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:292-303 [Conf]
  26. David Fernández-Baca, Giora Slutzki
    Parametric Problems on Graphs of Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:304-316 [Conf]
  27. Gaston H. Gonnet
    Efficient Two-dimensional Searching. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:317- [Conf]
  28. L. Paul Chew, Klara Kedem
    Improvements on Geometric Pattern Matching Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:318-325 [Conf]
  29. Deborah Joseph, Joao Meidanis, Prasoon Tiwari
    Determining DNA Sequence Similarity Using Maximum Independent Set Algorithms for Interval Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:326-337 [Conf]
  30. Emo Welzl
    New Results on Linear Programming and Related Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:338-339 [Conf]
  31. Mordecai J. Golin
    Dynamic Closest Pairs - A Probabilistic Approach. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:340-351 [Conf]
  32. Mark de Berg, Marc J. van Kreveld, Jack Snoeyink
    Two- and Three-Dimensional Point Location in Rectangular Subdivisions (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:352-363 [Conf]
  33. Bernard Chazelle, Leonidas Palios
    Decomposing the Boundary of a Nonconvex Polyhedron. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:364-375 [Conf]
  34. John Hershberger, Jack Snoeyink
    Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:376-387 [Conf]
  35. Hans-Peter Lenhof, Michiel H. M. Smid
    Maintaining the Visibility Map of Spheres while Moving the Viewpoint on a Circle at Infinity. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:388-398 [Conf]
  36. Gerhard Albers, Thomas Roos
    Voronoi Diagrams of Moving Points in Higher Dimensional Spaces. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:399-409 [Conf]
  37. Jyrki Katajainen, Tomi Pasanen
    Sorting Multisets Stably in Minimum Space. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:410-421 [Conf]
  38. Ola Petersson, Alistair Moffat
    A Framework for Adaptive Sorting. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:422-433 [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