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