Abstract is missing.
- Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)Martín Abadi, Phillip Rogaway. 3-22 [doi]
- Theory and Construction of Molecular ComputersMasami Hagiya. 23-24 [doi]
- List Decoding: Algorithms and ApplicationsMadhu Sudan. 25-41 [doi]
- Approximation Algorithms for String Folding ProblemsGiancarlo Mauri, Giulio Pavesi. 45-58 [doi]
- An Index for Two Dimensional String Matching Allowing RotationsKimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen. 59-75 [doi]
- Parallel Edge Coloring of a Tree on a Mesh Connected ComputerChang-Sung Jeong, Sung-Up Cho, Sun-Chul Whang, Mi Young Choi. 76-83 [doi]
- Paralle Approximation Algorithms for Maximum Weighted Matching in General GraphsRyuhei Uehara, Zhi-Zhong Chen. 84-98 [doi]
- In Is on the Boundary: Complexity Considerations for Polynominal IdealsErnst W. Mayr. 99 [doi]
- An Efficient Parallel Algorithm for Scheduling Interval Ordered TasksYoojin Chung, Kunsoo Park, Hyuk-Chul Kwon. 100-111 [doi]
- Task Distributions on Multiprocessor SystemsEvgeny V. Shchepin, Nodari Vakhania. 112-125 [doi]
- Fast Interpolation Using Kohonen Self-Organizing Neural NetworksOlivier Sarzeaud, Yann Stéphan. 126-139 [doi]
- Steganography Using Modern ArtsCarlo Blundo, Clemente Galdi. 140-151 [doi]
- Trade-Offs between Density and Robustness in Random Interconnection GraphsPhilippe Flajolet, Kostas P. Hatzis, Sotiris E. Nikoletseas, Paul G. Spirakis. 152-168 [doi]
- The (sigma+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a GraphSatoshi Taoka, Toshimasa Watanabe. 169-185 [doi]
- On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering ProblemSounaka Mishra, Kripasindhu Sikdar. 186-199 [doi]
- MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility GraphsStephan Eidenbenz, Christoph Stamm. 200-212 [doi]
- Real-Time Language Recognition by Alternating Cellular AutomataThomas Buchholz, Andreas Klein, Martin Kutrib. 213-225 [doi]
- Damage Spreading and µ-Sensitivity on Cellular AutomataBruno Martin. 226-242 [doi]
- Discrepancy Theory and Its Application to FinanceShu Tezuka. 243-256 [doi]
- Fully Consistent Extensions of Partially Defined Boolean Functions with Missing BitsEndre Boros, Toshihide Ibaraki, Kazuhisa Makino. 257-272 [doi]
- Characterization of Optimal Key Set ProtocolsTakaaki Mizuki, Hiroki Shizuya, Takao Nishizeki. 273-285 [doi]
- On the Complexity of Integer Programming in the Blum-Shub-Smale Computational ModelValentin E. Brimkov, Stefan S. Dantchev. 286-300 [doi]
- On Logarithmic Simulated AnnealingAndreas Alexander Albrecht, Chak-Kuen Wong. 301-314 [doi]
- Hierarchical State MachinesMihalis Yannakakis. 315-330 [doi]
- Ambient Groups and Mobility TypesLuca Cardelli, Giorgio Ghelli, Andrew D. Gordon. 333-347 [doi]
- An Asynchronous, Distributed Implementation of Mobile AmbientsCédric Fournet, Jean-Jacques Lévy, Alan Schmitt. 348-364 [doi]
- Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-BoundednessNaoki Kobayashi. 365-389 [doi]
- Local pi-Calculus at Work: Mobile Objects as Mobile ProcessesMassimo Merro, Josva Kleist, Uwe Nestmann. 390-408 [doi]
- An Interpretation of Typed Concurrent Objects in the Blue CalculusSilvano Dal-Zilio. 409-424 [doi]
- A Higher-Order Specification of the pi-CalculusJoëlle Despeyroux. 425-439 [doi]
- Open Ended Systems, Dynamic Bisimulation and Tile LogicRoberto Bruni, Ugo Montanari, Vladimiro Sassone. 440-456 [doi]
- Fibred Models of Processes: Discrete, Continuous, and Hybrid SystemsMarcelo P. Fiore. 457-473 [doi]
- On the Complexity of Bisimulation Problems for Pushdown AutomataRichard Mayr. 474-488 [doi]
- A Type-Theoretic Study on Partial ContinuationsYukiyoshi Kameyama. 489-504 [doi]
- Partially Typed Terms between Church-Style and Curry-StyleKen-etsu Fujita, Aleksy Schubert. 505-520 [doi]
- Alternating Automata and Logics over Infinite WordsChristof Löding, Wolfgang Thomas. 521-535 [doi]
- Hypothesis Support for Information Integration in Four-Valued LogicsYann Loyer, Nicolas Spyratos, Daniel Stamate. 536-548 [doi]
- Masaccio: A Formal Model for Embedded ComponentsThomas A. Henzinger. 549-563 [doi]
- A Single Complete Refinement Rule for Demonic SpecificationsKarl Lermer, Paul A. Strooper. 564-579 [doi]
- Reasoning about Composition Using Property Transformers and Their ConjugatesMichel Charpentier, K. Mani Chandy. 580-595 [doi]
- Some New Directions in the Syntax and Semantics of Formal LanguagesGordon D. Plotkin. 596 [doi]
- New Challenges for Theoretical Computer ScienceJozef Gruska. 599-601 [doi]
- Algorithm Design ChallengesGiorgio Ausiello. 602-603 [doi]
- Quantumization of Theoretical InformaticsJozef Gruska. 604-608 [doi]
- Two Problems in Wide Area Network ProgrammingUgo Montanari. 609-611 [doi]
- New Challenges for Compuational ModelsYoshihito Toyama. 612-613 [doi]
- Towards a Computational Theory of EverythingJirí Wiedermann. 614-615 [doi]
- On the Power of Interactive ComputingJan van Leeuwen, Jirí Wiedermann. 619-623 [doi]
- The Varieties of Programming Language SemanticsPeter D. Mosses. 624-628 [doi]