The SCEAS System
Navigation Menu

Conferences in DBLP

European Symposium on Algorithms (ESA) (esa)
1996 (conf/esa/1996)

  1. Robert Sedgewick
    Analysis of Shellsort and Related Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:1-11 [Conf]
  2. Ashim Garg, Roberto Tamassia, Paola Vocca
    Drawing with Colors (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:12-26 [Conf]
  3. Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc
    Approximating the Unsatisfiability Threshold of Random Formulas (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:27-38 [Conf]
  4. Uwe Schwiegelshohn
    Preemptive Weighted Completion Time Scheduling of Parallel Jobs. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:39-51 [Conf]
  5. Jordan Gergov
    Approximation Algorithms for Dynamic Storage Allocations. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:52-61 [Conf]
  6. Luca Trevisan
    Positive Linear Programming, Parallel Approximation and PCP's. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:62-75 [Conf]
  7. Rolf H. Möhring, Markus W. Schäffter, Andreas S. Schulz
    Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:76-90 [Conf]
  8. Salvador Roura, Conrado Martínez
    Randomization of Search Trees by Subtree Size. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:91-106 [Conf]
  9. Paolo Ferragina, S. Muthukrishnan
    Efficient Dynamic Method-Lookup for Object Oriented Languages (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:107-120 [Conf]
  10. Rajeev Raman
    Priority Queues: Small, Monotone and Trans-dichotomous. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:121-137 [Conf]
  11. Andreas Nolte, Rainer Schrader
    Simulated Annealing and Its Problems to Color Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:138-151 [Conf]
  12. Samir Khuller, Yoram J. Sussmann
    The Capacitated K-Center Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:152-166 [Conf]
  13. Toshihiro Fujito
    A Unified Local Ratio Approximation of Node-Deletion Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:167-178 [Conf]
  14. Sudipto Guha, Samir Khuller
    Approximation Algorithms for Connected Dominating Sets. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:179-193 [Conf]
  15. Alan M. Frieze, Wojciech Szpankowski
    Greedy Algorithms for the Shortest Common Superstring that are Asmtotically Optimal. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:194-207 [Conf]
  16. Tatsuie Tsukiji, Fatos Xhafa
    On the Depth of Randomly Generated Circuits. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:208-220 [Conf]
  17. Alfredo Viola, Patricio V. Poblete
    The Analysis of Linear Probing Hashing with Buckets (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:221-233 [Conf]
  18. Danny Z. Chen, Wei Chen, Koichi Wada, Kimio Kawaguchi
    Parallel Algorithms for Partitioning Sorted Sets and Related Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:234-245 [Conf]
  19. Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys
    Fast Generation of Random Permutations via Networks Simulation. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:246-260 [Conf]
  20. Paolo Ferragina, Fabrizio Luccio
    On the Parallel Dynamic Dictionary Matching Problem: New Results with Applications. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:261-275 [Conf]
  21. Hans L. Bodlaender, Babette de Fluiter
    Parallel Algorithms for Series Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:277-289 [Conf]
  22. Mauro Leoncini, Giovanni Manzini, Luciano Margara
    Parallel Complexity of Householder QR Factorization. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:290-301 [Conf]
  23. Julien Basch, Leonidas J. Guibas, G. D. Ramkumar
    Reporting Red-Blue Intersections between Two Sets of Connected Line Segments. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:302-319 [Conf]
  24. Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber
    Matching Convex Shapes with Respect to the Symmetric Difference. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:320-333 [Conf]
  25. Esther M. Arkin, Yi-Jen Chiang, Martin Held, Joseph S. B. Mitchell, Vera Sacristan, Steven Skiena, Tae-Heng Yang
    On Minimum-Area Hulls (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:334-348 [Conf]
  26. Boris V. Cherkassky, Andrew V. Goldberg
    Negative-Cycle Detection Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:349-363 [Conf]
  27. Bruce W. Watson
    A New Regular Grammar Pattern Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:364-377 [Conf]
  28. Juha Kärkkäinen, Erkki Sutinen
    Lempel-Ziv Index for q-Grams. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:378-391 [Conf]
  29. Ralf Heckmann, Thomas Lengauer
    Computing Upper and Lower Bounds on Textile Nesting Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:392-405 [Conf]
  30. Noga Alon, János Csirik, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger
    On-line and Off-line Approximation Algorithms for Vector Covering Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:406-418 [Conf]
  31. Dimitris Achlioptas, Marek Chrobak, John Noga
    Competive Analysis of Randomized Paging Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:419-430 [Conf]
  32. Baruch Awerbuch, Yossi Azar, Amos Fiat, Stefano Leonardi, Adi Rosén
    On-line Competive Algorithms for Call Admission in Optical Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:431-444 [Conf]
  33. Philip N. Klein, Hsueh-I Lu, Robert H. B. Netzer
    Race-Condition Detection in Parallel Computation with Semaphores (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:445-459 [Conf]
  34. Christos Kaklamanis, Giuseppe Persiano
    Efficient Wavelength Routing on Directed Fiber Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:460-470 [Conf]
  35. Ishai Ben-Aroya, Donald D. Chinn, Assaf Schuster
    A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:471-485 [Conf]
  36. George Christopher, Martin Farach, Michael A. Trick
    The Structure of Circular Decomposable Metrics. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:486-500 [Conf]
  37. Anders Dessmark, Andrzej Lingas, Andrzej Proskurowski
    Faster Algorithms for Subgraph Isomorphism of k-Connected Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:501-513 [Conf]
  38. Srinivasa Rao Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das, Michiel H. M. Smid, Christos D. Zaroliagis
    Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:514-528 [Conf]
  39. Vincenzo Auletta, Domenico Parente, Giuseppe Persiano
    A New Approach to Optimal Planning of Robot Motion on a Tree with Obstacles. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:529-545 [Conf]
  40. Alejandro López-Ortiz, Sven Schuierer
    Generalized Streets Revisited. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:546-558 [Conf]
  41. Christos H. Papadimitriou
    Computational Aspacts of Organization Theory (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:559-564 [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