default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3rd IFIP TCS 2004: Toulouse, France
- Jean-Jacques Lévy, Ernst W. Mayr, John C. Mitchell:
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. IFIP 155, Kluwer/Springer 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
- Ilia Toli, Alberto Zanoni:
Looking Inside AES and BES. 23-36 - 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 - Toshio Suzuki, Tomoyuki Yamakami:
Resource Bounded Immunity and Simplicity. 81-96 - Holger Spakowski, Rahul Tripathi:
Degree Bounds on Polynomials and Relativization Theory. 97-110 - Hubert Schmid, Thomas Worsch:
The Firing Squad Synchronization Problem with Many Generals For One-Dimensional CA. 111-124 - Ömer Egecioglu, Oscar H. Ibarra:
A Matrix q-Analogue of the Parikh Map. 125-138 - Hagit Attiya, David Hay:
The Inherent Queuing Delay of Parallel Packet Switches. 139-152 - 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 - Livio Colussi, Gilberto Filé, Alberto Griggio:
Precise Analysis of π-Calculus in Cubic Time. 317-331
Track (2) on Logic, Semantics, Specification, and Verification
- Martin Wildmoser, Tobias Nipkow, Gerwin Klein, Sebastian Nanz:
Prototyping Proof Carrying Code. 333-347 - Zhiming Liu, Jifeng He, Xiaoshan Li:
Contract Oriented Development of Component Software. 349-366 - Roberto Bruni, José Luiz Fiadeiro, Ivan Lanese, Antónia Lopes, Ugo Montanari:
New Insights on Architectural Connectors. 367-380 - Iovka Boneva, Jean-Marc Talbot:
On Complexity of Model-Checking for the TQL Logic. 381-394 - 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 - Davide Ancona, Sonia Fagorzi, Elena Zucca:
A Calculus with Lazy Module Operators. 423-436 - 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 - Deepak Garg, Akash Lal, Sanjiva Prasad:
Effective Chemistry for Synchrony and Asynchrony. 479-492 - Christel Baier, Marcus Größer, Martin Leucker, Benedikt Bollig, Frank Ciesinski:
Controller Synthesis for Probabilistic Systems. 493-506 - Petr Jancar, Jirí Srba:
Highly Undecidable Questions for Process Algebras. 507-520 - Glynn Winskel, Francesco Zappa Nardelli:
New-HOPLA: A Higher-order Process Language with Name Generation. 521-534 - Sergio Maffeis, Philippa Gardner:
Behavioural Equivalences for Dynamic Web Data. 535-548 - Massimo Merro, Francesco Zappa Nardelli:
Behavioural Theory for Mobile Ambients. 549-562 - 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. 591-604 - David Teller:
Recovering Resources in the π-calculus. 605-618 - Yuxin Deng, Davide Sangiorgi:
Ensuring Termination by Typability. 619-632 - Benjamin Wack:
The Simply-typed Pure Pattern Type System Ensures Strong Normalization. 633-646 - Jules Desharnais, Bernhard Möller, Georg Struth:
Termination in Modal Kleene Algebra. 647-660 - Alain Frisch:
Regular Tree Language Recognition with Static Information. 661-674
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
