2. IFIP TCS 2002:
Montréal,
Québec,
Canada
Ricardo A. Baeza-Yates, Ugo Montanari, Nicola Santoro (Eds.):
Foundations of Information Technology in the Era of Networking and Mobile Computing, IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), August 25-30, 2002, Montréal, Québec, Canada.
IFIP Conference Proceedings 223 Kluwer 2002, ISBN 1-4020-7181-7 
@proceedings{DBLP:conf/ifipTCS/2002,
editor = {Ricardo A. Baeza-Yates and
Ugo Montanari and
Nicola Santoro},
title = {Foundations of Information Technology in the Era of Networking
and Mobile Computing, IFIP 17$^{\mbox{th}}$ World Computer Congress - TC1 Stream / 2$^{\mbox{nd}}$ IFIP International Conference on Theoretical Computer Science
(TCS 2002), August 25-30, 2002, Montr{\'e}al, Qu{\'e}bec,
Canada},
booktitle = {IFIP TCS},
publisher = {Kluwer},
series = {IFIP Conference Proceedings},
volume = {223},
year = {2002},
isbn = {1-4020-7181-7},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Algorithms,
Complexity and Models of Computation
Invited Papers
Contributed Papers
- Jochen Alber, Jirí Fiala:
Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs.
26-37
- Nikhil Bansal, Zhen Liu, Arvind Sankar:
Bin-Packing with Fragile Objects.
38-46
- Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal:
Lower and Upper Bounds for Tracking Mobile Users.
47-58
- Alina Beygelzimer, Mitsunori Ogihara:
On the Enumerability of the Determinant and the Rank.
59-70
- Douglas M. Blough, Mauro Leoncini, Giovanni Resta, Paolo Santi:
On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks.
71-82
- Beate Bollig, Stephan Waack, Philipp Woelfel:
Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication.
83-94
- Vasco Brattka, Martin Ziegler:
Computability of Linear Equations.
95-106
- Véronique Bruyère, Olivier Carton:
Hierarchy Among Automata on Linear Orderings.
107-118
- Gruia Calinescu, Ion I. Mandoiu, Alexander Zelikovsky:
Symmetric Connectivity with Minimum Power Consumption in Radio Networks.
119-130
- Zhao Chen:
A Modified Recursive Triangular Factorization for Cauchy-like Systems.
131-142
- Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl:
Algorithmic Complexity of Protein Identification: Searching in Weighted Strings.
143-156
- Alessandro Dal Palù, Enrico Pontelli, Desh Ranjan:
An Efficient Parallel Pointer Machine Algorithm for the NCA Problem.
157-168
- Marie Duflot, Laurent Fribourg, Claudine Picaronny:
Randomized Dining Philosophers without Fairness Assumption.
169-180
- Alon Efrat, Sariel Har-Peled:
Guarding Galleries and Terrains.
181-192
- Leszek Gasieniec, Igor Potapov:
Gossiping with Unit Messages in Known Radio Networks.
193-205
- Nicolas Hanusse, Dimitris J. Kavvadias, Evangelos Kranakis, Danny Krizanc:
Memoryless Search Algorithms in a Network with Faulty Advice.
206-216
- Lane A. Hemaspaandra, Mayur Thakur:
Lower Bounds and the Hardness of Counting Properties.
217-229
- Matthew Hertz, Neil Immerman, J. Eliot B. Moss:
Framework for Analyzing Garbage Collection.
230-242
(extended version)
- Christopher M. Homan, Mayur Thakur:
One-Way Permutations and Self-Witnessing Languages.
243-254
- Klaus Jansen, Hu Zhang:
Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function.
255-266
- Grégory Lafitte:
On Randomness and Infinity.
267-279
- Aris Pagourtzis, Paolo Penna, Konrad Schlude, Kathleen Steinhöfel, David Scot Taylor, Peter Widmayer:
Server Placements, Roman Domination and other Dominating Set Variants.
280-291
- B. S. Panda, Sajal K. Das:
A Linear Time Algorithm for Finding Tree 3-Spanner on 2-Trees.
292-309
- Jörg Rothe, Holger Spakowski, Jörg Vogel:
Exact Complexity of Exact-Four-Colorability and of the Winner Problem for Young Elections.
310-322
- Tomoyuki Yamakami:
Quantum NP and Quantum Hierarchy.
323-336
- Marius Zimand:
Probabilistically Checkable Proofs the Easy Way.
337-351
Logic Semantics,
Specification and Verification
Invited Papers
Contributed Papers
- Patrick Baillot:
Checking Polynomial Time Complexity with Types.
370-382
- Chiara Braghin, Agostino Cortesi, Riccardo Focardi, Steffen van Bakel:
Boundary Inference for Enforcing Security Policies in Mobile Ambients.
383-395
- Aline Brum Loreto, Leila Ribeiro, Laira Vieira Toscani:
Decidability and Tractability of Problems in Object-Based Graph Grammars.
396-408
- Hana Chockler, Orna Kupferman:
Coverage of Implementations by Simulating Specifications.
409-421
- Giovanni Conforti, Orlando Ferrara, Giorgio Ghelli:
TQL Algebra and its Implementation.
422-434
- Dino Distefano, Arend Rensink, Joost-Pieter Katoen:
Model Checking Birth and Death.
435-447
- Matthew Fluet, Riccardo Pucella:
Phantom Types and Subtyping.
448-460
- Rachid Guerraoui, Petr Kouznetsov:
On the Weakest Failure Detector for Non-Blocking Atomic Commit.
461-473
- Martin Hyland, Gordon D. Plotkin, John Power:
Combining Computational Effects: commutativity & sum.
474-484
- Salvatore La Torre, Supratik Mukhopadhyay, Aniello Murano:
Optimal-Reachability and Control for Acyclic Weighted Timed Automata.
485-497
- Daniel Leivant:
Substructural Verification and Computational Feasibility.
498-510
- Daniel J. Dougherty, Stéphane Lengrand, Pierre Lescanne:
An Improved System of Intersection Types for Explicit Substitutions.
511-523
- Fabio Martinelli:
About Compositional Analysis of Pi-Calculus Processes.
524-536
- Catuscia Palamidessi, Oltea Mihaela Herescu:
A Randomized Distributed Encoding of the Pi-Calculus with Mixed Choice.
537-549
- Iain Phillips, Maria Grazia Vigliotti:
On Reduction Semantics for the Push and Pull Ambitent Calculus.
550-562
- Alan Schmitt:
Safe Dynamic Binding in the Join Calculus.
563-575
- Olivier Serre:
Vectorial Languages and Linear Temporal Logic.
576-587
- Scott D. Stoller:
A Bound on Attacks on Authentication Protocols.
588-600
- Xiaogang Zhang, John Potter:
Responsive Bisimulation.
601-612
Copyright © Mon Nov 2 20:49:47 2009
by Michael Ley (ley@uni-trier.de)
