3. IFIP TCS 2004: Toulouse, France
Jean-Jacques Lévy, Ernst W. Mayr, John C. Mitchell (Eds.): Exploring New Frontiers of Theoretical Informatics, IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004), 22-27 August 2004, Toulouse, France. Kluwer 2004 ISBN 1-4020-8140-5
Invited talks
- Gaston H. Gonnet: The tPI (tRNA Pairing Index), a Mathematical Measure of Repetition in a (Biological) Sequence. 1-2
- Juraj Hromkovic: Stability of Approximation in Discrete Optimization. 3-18
- Robin Milner: Towards a Broader Theory of Mobile Processes. 19
- Michaël Rusinowitch: A Decidable Analysis of Security Protocols. 21
Track (1) on Algorithms, Complexity, and Models of Computation
- Zhaohui Cheng, Richard Comley, Luminita Vasiu: Remove Key Escrow from The Identity-Based Encryption System. 37-50
- An Braeken, Christopher Wolf, Bart Preneel: A Randomised Algorithm for Checking the Normality of Cryptographic Boolean Functions. 51-66
- Alex Brodsky: Reversible Circuit Realizations of Boolean Functions. 67-80
- Hubert Schmid, Thomas Worsch: The Firing Squad Synchronization Problem with Many Generals For One-Dimensional CA. 111-124
- Paola Flocchini, Antonio Mesa Enriques, Linda Pagli, Giuseppe Prencipe, Nicola Santoro: Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree. 153-166
- Giovanna Melideo, Paolo Penna, Guido Proietti, Roger Wattenhofer, Peter Widmayer: Truthful Mechanisms for Generalized Utilitarian Problems. 167-180
- Sébastien Baehni, Roberto Baldoni, Rachid Guerraoui, Bastian Pochon: The Driving Philosophers. 181-194
- Roman Dementiev, Peter Sanders, Dominik Schultes, Jop F. Sibeyn: Engineering an External Memory Minimum Spanning Tree Algorithm. 195-208
- Mark Cieliebak, Thomas Erlebach, Fabian Hennecke, Birgitta Weber, Peter Widmayer: Scheduling with Release Times and Deadlines on a Minimum Number of Machines. 209-222
- Klaus Jansen: Approximation Algorithms for Mixed Fractional Packing and Covering Problems. 223-236
- Aleksei V. Fishkin, Olga Gerber, Klaus Jansen: On Weighted Rectangle Packing with Large Resources. 237-250
- Satoko Mamada, Takeaki Uno, Kazuhisa Makino, Satoru Fujishige: An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks. 251-264
- Costas S. Iliopoulos, Christos Makris, Yannis Panagis, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis: Efficient Algorithms for Handling Molecular Weighted Sequences. 265-278
- Hiro Ito, Kazuo Iwama, Takeyuki Tamura: Imperfectness of Data for STS-Based Physical Mapping. 279-292
- Hu Zhang: Solving Packing Problem with Weaker Block Solvers. 293-306
- Amr Elmasry: Adaptive Sorting with AVL Trees. 307-316
Track (2) on Logic, Semantics, Specification, and Verification
- Martin Wildmoser, Tobias Nipkow, Gerwin Klein, Sebastian Nanz: Prototyping Proof Carrying Code. 333-348
- Roberto Bruni, José Luiz Fiadeiro, Ivan Lanese, Antónia Lopes, Ugo Montanari: New Insights on Architectural Connectors. 367-380
- Antonín Kucera, Richard Mayr: A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata. 395-408
- Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion: Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures. 409-422
- Xinming Ou, Gang Tan, Yitzhak Mandelbaum, David Walker: Dynamic Typing with Dependent Types. 437-450
- Lorenzo Bettini, Viviana Bono, Betti Venneri: Subtyping-Inheritance Conflicts: The Mobile Mixin Case. 451-464
- Chung-Chih Li: Asymptotic Behaviors of Type-2 Algorithms and Induced Baire Topologies. 465-478
- Christel Baier, Marcus Größer, Martin Leucker, Benedikt Bollig, Frank Ciesinski: Controller Synthesis for Probabilistic Systems. 493-506
- Glynn Winskel, Francesco Zappa Nardelli: New-HOPLA: A Higher-order Process Language with Name Generation. 521-534
- Roberto Bruni, Hernán C. Melgratti, Ugo Montanari: Nested Commits for Mobile Calculi: Extending Join. 563-576
- Mario Coppo, Mariangiola Dezani-Ciancaglini, Elio Giovannetti, Rosario Pugliese: Dynamic and Local Typing for Mobile Ambients. 577-590
- Torben Amtoft, Henning Makholm, J. B. Wells: PolyA: True Type Polymorphism for Mobile Ambients. 591604
- David Teller: Recovering Resources in the p-calculus. 605-618
- Benjamin Wack: The Simply-typed Pure Pattern Type System Ensures Strong Normalization. 633-646
- Alain Frisch: Regular Tree Language Recognition with Static Information. 661-674
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team