22. ICALP 1995:
Szeged,
Hungary
Zoltán Fülöp, Ferenc Gécseg (Eds.):
Automata, Languages and Programming, 22nd International Colloquium, ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings.
Lecture Notes in Computer Science 944 Springer 1995, ISBN 3-540-60084-1 BibTeX
@proceedings{DBLP:conf/icalp/1995,
editor = {Zolt{\'a}n F{\"u}l{\"o}p and
Ferenc G{\'e}cseg},
title = {Automata, Languages and Programming, 22nd International Colloquium,
ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings},
booktitle = {ICALP},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {944},
year = {1995},
isbn = {3-540-60084-1},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Concurrency I
Automata and Formal Languages I
Algorithms I
Communication Protocols
- Jean-Claude Bermond, Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro:
Fast Gossiping by Short Messages.
135-146 BibTeX
- Feng Bao, Yoshihide Igarashi:
Break Finite Automata Public Key Cryptosystem.
147-158 BibTeX
- Sotiris E. Nikoletseas, John H. Reif, Paul G. Spirakis, Moti Yung:
Stocastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time.
159-170 BibTeX
- Carlo Blundo, Alfredo De Santis, Giuseppe Persiano, Ugo Vaccaro:
On the Number of Random Bits in Totally Private Computation.
171-182 BibTeX
Computational Complexity I
Algorithms II
- Frank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia:
Optimal Shooting: Characterizations and Applications.
220-231 BibTeX
- Vincenzo Auletta, Domenico Parente, Giuseppe Persiano:
Placing Resources in a Tree: Dynamic and Static Algorithms.
232-243 BibTeX
- Shiva Chaudhuri, Christos D. Zaroliagis:
Shortest Path Queries in Digraphs of Small Treewidth.
244-255 BibTeX
- Mordecai J. Golin, Günter Rote:
A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs.
256-267 BibTeX
Algorithms III
Automata and Formal Languages II
Computational Complexity II
Computability
Automata and Formal Languages III
Algorithms IV
- Panayiotis Bozanis, Nectarios Kitsios, Christos Makris, Athanasios K. Tsakalidis:
New Upper Bounds for Generalized Intersection Searching Problems.
464-474 BibTeX
- Bernd Becker, Rolf Drechsler, Michael Theobald:
OKFDDs versus OBDDs and OFDDs.
475-486 BibTeX
- Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III:
Bicriteria Network Design Problems.
487-498 BibTeX
- Ngoc-Minh Lê:
On Determining Optimal Strategies in Pursiut Games in the Plane.
499-510 BibTeX
Foundations of Programming
Learning,
Coding,
Robotics
- Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan:
Measure, Category and Learning Theory.
558-569 BibTeX
- Michel Cosnard, Eric Goles Ch.:
A Characterization of the Existence of Energies for Neural Networks.
570-580 BibTeX
- Helmut Jürgensen, Stavros Konstantinidis:
Variable-Length Codes for Error Correction.
581-592 BibTeX
- Samir Khuller, Ehud Rivlin, Azriel Rosenfeld:
Graphbots: Mobility in Discrete Spaces.
593-604 BibTeX
Semantics
Concurrency II
Copyright © Sat May 16 23:16:05 2009
by Michael Ley (ley@uni-trier.de)
