CIAC C

28 papers

YearTitle / Authors
1997A Meticulous Analysis of Mergesort Programs.
Jyrki Katajainen, Jesper Larsson Träff
1997A Note on Updating Suffix Tree Labels.
Paolo Ferragina, Roberto Grossi, Manuela Montangero
1997Algorithms and Complexity, Third Italian Conference, CIAC '97, Rome, Italy, March 12-14, 1997, Proceedings
Gian Carlo Bongiovanni, Daniel P. Bovet, Giuseppe Di Battista
1997Algorithms and Data Structures for Control Dependence and Related Compiler Problems.
Gianfranco Bilardi
1997An Improved Deterministic Algorithms for Generalized Random Sampling.
Amihood Amir, Emanuel Dar
1997An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons.
Amitava Datta, Kamala Krithivasan, Thomas Ottmann
1997Area Requirement of Gabriel Drawings.
Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis, Paola Vocca
1997BSP-Like External-Memory Computation.
Jop F. Sibeyn, Michael Kaufmann
1997Design of Reliable Combinatorial Algorithms Using Certificates.
Fabrizio Luccio, Alberto Pedrotti
1997Embedding Interconnection Networks in Grids via the Layered Cross Product.
Guy Even, Shimon Even
1997Fault Tolerant K-Center Problems.
Samir Khuller, Robert Pless, Yoram J. Sussmann
1997Finding Optimum
Yefim Dinitz, Zeev Nutov
1997Hardness of Approximating Problems on Cubic Graphs.
Paola Alimonti, Viggo Kann
1997Isomorphism for Graphs of Bounded Distance Width.
Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos
1997Maintaining Maxima under Boundary Updates.
Fabrizio d'Amore, Paolo Giulio Franciosa, Roberto Giaccio, Maurizio Talamo
1997Nice Drawings for Planar Bipartite Graphs.
Ulrich Fößmeier, Michael Kaufmann
1997On Removing Non-degeneracy Assumptions in Computational Geometry.
Francisco Gómez, Suneeta Ramaswami, Godfried T. Toussaint
1997On Sets with Easy Certificates and the Existence of One-Way Permutations.
Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung
1997On the Complexity of Balanced Boolean Functions.
Anna Bernasconi
1997On the Drift of Short Schedules.
Uriel Feige, Giora Rayzman
1997Polynominal Time Algorithms for Some Self-Duality Problems.
Carlos Domingo
1997R
Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
1997Relaxed Balanced Red-Black Trees.
Sabine Hanke, Thomas Ottmann, Eljas Soisalon-Soininen
1997Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy.
Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino
1997The Algorithmic Complexity of Chemical Threshold Testing.
Peter Damaschke
1997The Optimum Cost Chromatic Partition Problem.
Klaus Jansen
1997Topological Chaos for Elementary Cellular Automata.
Gianpiero Cattaneo, Michele Finelli, Luciano Margara
1997Tree Contractions and Evolutionary Trees.
Ming-Yang Kao