Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/conf/icalp/icalp2005.bht:"
@inproceedings{DBLP:conf/icalp/AbadiW05, author = {Mart{\'{\i}}n Abadi and Bogdan Warinschi}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Password-Based Encryption Analyzed}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {664--676}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_54}, doi = {10.1007/11523468\_54}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/AbadiW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/AbdullaDOW05, author = {Parosh Aziz Abdulla and Johann Deneux and Jo{\"{e}}l Ouaknine and James Worrell}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Decidability and Complexity Results for Timed Automata via Channel Machines}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1089--1101}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_88}, doi = {10.1007/11523468\_88}, timestamp = {Thu, 14 Sep 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/AbdullaDOW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/AlstrupGRTZ05, author = {Stephen Alstrup and Inge Li G{\o}rtz and Theis Rauhe and Mikkel Thorup and Uri Zwick}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Union-Find with Constant Time Deletions}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {78--89}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_7}, doi = {10.1007/11523468\_7}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/AlstrupGRTZ05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/AlurKMV05, author = {Rajeev Alur and Viraj Kumar and P. Madhusudan and Mahesh Viswanathan}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Congruences for Visibly Pushdown Languages}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1102--1114}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_89}, doi = {10.1007/11523468\_89}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/AlurKMV05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Ambuhl05, author = {Christoph Amb{\"{u}}hl}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {An Optimal Bound for the {MST} Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1139--1150}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_92}, doi = {10.1007/11523468\_92}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Ambuhl05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/AsarinC05, author = {Eugene Asarin and Pieter Collins}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Noisy Turing Machines}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1031--1042}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_83}, doi = {10.1007/11523468\_83}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/AsarinC05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/AtseriasDG05, author = {Albert Atserias and Anuj Dawar and Martin Grohe}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Preservation Under Extensions on Well-Behaved Finite Structures}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1437--1449}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_116}, doi = {10.1007/11523468\_116}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/AtseriasDG05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/AvinE05, author = {Chen Avin and Gunes Ercal}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {On the Cover Time of Random Geometric Graphs}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {677--689}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_55}, doi = {10.1007/11523468\_55}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/AvinE05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BadoiuCIS05, author = {Mihai Badoiu and Artur Czumaj and Piotr Indyk and Christian Sohler}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Facility Location in Sublinear Time}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {866--877}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_70}, doi = {10.1007/11523468\_70}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BadoiuCIS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BadouelCG05, author = {{\'{E}}ric Badouel and Jules Chenou and Goulven Guillou}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Petri Algebras}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {742--754}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_60}, doi = {10.1007/11523468\_60}, timestamp = {Thu, 06 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BadouelCG05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BaldamusPV05, author = {Michael Baldamus and Joachim Parrow and Bj{\"{o}}rn Victor}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {A Fully Abstract Encoding of the \emph{pi}-Calculus with Data Terms}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1202--1213}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_97}, doi = {10.1007/11523468\_97}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BaldamusPV05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BaudetCK05, author = {Mathieu Baudet and V{\'{e}}ronique Cortier and Steve Kremer}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Computationally Sound Implementations of Equational Theories Against Passive Adversaries}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {652--663}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_53}, doi = {10.1007/11523468\_53}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BaudetCK05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BealLS05, author = {Marie{-}Pierre B{\'{e}}al and Sylvain Lombardy and Jacques Sakarovitch}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {On the Equivalence of -Automata}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {397--409}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_33}, doi = {10.1007/11523468\_33}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BealLS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BeamePS05, author = {Paul Beame and Toniann Pitassi and Nathan Segerlind}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Lower Bounds for Lov{\'{a}}sz-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1176--1188}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_95}, doi = {10.1007/11523468\_95}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BeamePS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BeaudryLT05, author = {Martin Beaudry and Fran{\c{c}}ois Lemieux and Denis Th{\'{e}}rien}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Groupoids That Recognize Only Regular Languages}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {421--433}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_35}, doi = {10.1007/11523468\_35}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BeaudryLT05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BerenbrinkFM05, author = {Petra Berenbrink and Tom Friedetzky and Russell A. Martin}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Dynamic Diffusion Load Balancing}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1386--1398}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_112}, doi = {10.1007/11523468\_112}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BerenbrinkFM05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BilleG05, author = {Philip Bille and Inge Li G{\o}rtz}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {The Tree Inclusion Problem: In Optimal Space and Faster}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {66--77}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_6}, doi = {10.1007/11523468\_6}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BilleG05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BorodinCM05, author = {Allan Borodin and David Cashman and Avner Magen}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {How Well Can Primal-Dual and Local-Ratio Algorithms Perform?}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {943--955}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_76}, doi = {10.1007/11523468\_76}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BorodinCM05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BradleyMS05, author = {Aaron R. Bradley and Zohar Manna and Henny B. Sipma}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {The Polyranking Principle}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1349--1361}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_109}, doi = {10.1007/11523468\_109}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BradleyMS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BraekenBNP05, author = {An Braeken and Yuri L. Borissov and Svetla Nikova and Bart Preneel}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Classification of Boolean Functions of 6 Variables or Less with Respect to Some Cryptographic Properties}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {324--334}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_27}, doi = {10.1007/11523468\_27}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BraekenBNP05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BreugelHMW05, author = {Franck van Breugel and Claudio Hermida and Michael Makkai and James Worrell}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {An Accessible Approach to Behavioural Pseudometrics}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1018--1030}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_82}, doi = {10.1007/11523468\_82}, timestamp = {Thu, 14 Sep 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BreugelHMW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BrodalFM05, author = {Gerth St{\o}lting Brodal and Rolf Fagerberg and Gabriel Moruz}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Cache-Aware and Cache-Oblivious Adaptive Sorting}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {576--588}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_47}, doi = {10.1007/11523468\_47}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BrodalFM05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/CastagnaF05, author = {Giuseppe Castagna and Alain Frisch}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {A Gentle Introduction to Semantic Subtyping}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {30--34}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_3}, doi = {10.1007/11523468\_3}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/CastagnaF05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/CatalanoV05, author = {Dario Catalano and Ivan Visconti}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Hybrid Trapdoor Commitments and Their Applications}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {298--310}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_25}, doi = {10.1007/11523468\_25}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/CatalanoV05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/ChanLW05, author = {Wun{-}Tat Chan and Tak Wah Lam and Prudence W. H. Wong}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Dynamic Bin Packing of Unit Fractions Items}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {614--626}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_50}, doi = {10.1007/11523468\_50}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/ChanLW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/ChatterjeeAH05, author = {Krishnendu Chatterjee and Luca de Alfaro and Thomas A. Henzinger}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {The Complexity of Stochastic Rabin and Streett Games'}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {878--890}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_71}, doi = {10.1007/11523468\_71}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/ChatterjeeAH05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/ChattopadhyayH05, author = {Arkadev Chattopadhyay and Kristoffer Arnsfelt Hansen}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Lower Bounds for Circuits with Few Modular and Symmetric Gates}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {994--1005}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_80}, doi = {10.1007/11523468\_80}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/ChattopadhyayH05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/ChevalierR05, author = {Yannick Chevalier and Micha{\"{e}}l Rusinowitch}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Combining Intruder Theories}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {639--651}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_52}, doi = {10.1007/11523468\_52}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/ChevalierR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/ChiniforooshanFM05, author = {Ehsan Chiniforooshan and Arash Farzan and Mehdi Mirzazadeh}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Worst Case Optimal Union-Intersection Expression Evaluation}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {179--190}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_15}, doi = {10.1007/11523468\_15}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/ChiniforooshanFM05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/ChlebusGKR05, author = {Bogdan S. Chlebus and Leszek Gasieniec and Dariusz R. Kowalski and Tomasz Radzik}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {On the Wake-Up Problem in Radio Networks}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {347--359}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_29}, doi = {10.1007/11523468\_29}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/ChlebusGKR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/CohenFIKP05, author = {Reuven Cohen and Pierre Fraigniaud and David Ilcinkas and Amos Korman and David Peleg}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Label-Guided Graph Exploration by a Finite Automaton}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {335--346}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_28}, doi = {10.1007/11523468\_28}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/CohenFIKP05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/ConfortiMS05, author = {Giovanni Conforti and Damiano Macedonio and Vladimiro Sassone}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Spatial Logics for Bigraphs}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {766--778}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_62}, doi = {10.1007/11523468\_62}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/ConfortiMS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/CrescenzoK05, author = {Giovanni Di Crescenzo and Aggelos Kiayias}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Asynchronous Perfectly Secure Communication over One-Time Pads}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {216--227}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_18}, doi = {10.1007/11523468\_18}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/CrescenzoK05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/CrescenzoV05, author = {Giovanni Di Crescenzo and Ivan Visconti}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Concurrent Zero Knowledge in the Public-Key Model}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {816--827}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_66}, doi = {10.1007/11523468\_66}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/CrescenzoV05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/CzeizlerK05, author = {Eugen Czeizler and Jarkko Kari}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {A Tight Linear Bound on the Neighborhood of Inverse Cellular Automata}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {410--420}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_34}, doi = {10.1007/11523468\_34}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/CzeizlerK05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/DattaDMST05, author = {Anupam Datta and Ante Derek and John C. Mitchell and Vitaly Shmatikov and Mathieu Turuani}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Probabilistic Polynomial-Time Semantics for a Protocol Security Logic}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {16--29}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_2}, doi = {10.1007/11523468\_2}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/DattaDMST05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/DelzannoG05, author = {Giorgio Delzanno and Maurizio Gabbrielli}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Compositional Verification of Asynchronous Processes via Constraint Solving}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1239--1250}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_100}, doi = {10.1007/11523468\_100}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/DelzannoG05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/DiehlM05, author = {Scott Diehl and Dieter van Melkebeek}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {982--993}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_79}, doi = {10.1007/11523468\_79}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/DiehlM05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/DietzfelbingerW05, author = {Martin Dietzfelbinger and Christoph Weidling}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {166--178}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_14}, doi = {10.1007/11523468\_14}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/DietzfelbingerW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/DimitrovP05, author = {Nedialko B. Dimitrov and C. Greg Plaxton}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Optimal Cover Time for a Graph-Based Coupon Collector Process}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {702--716}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_57}, doi = {10.1007/11523468\_57}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/DimitrovP05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/DonatoLT05, author = {Debora Donato and Stefano Leonardi and Panayiotis Tsaparas}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Stability and Similarity of Link Analysis Ranking Algorithms}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {717--729}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_58}, doi = {10.1007/11523468\_58}, timestamp = {Tue, 27 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/DonatoLT05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/DrosteG05, author = {Manfred Droste and Paul Gastin}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Weighted Automata and Weighted Logics}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {513--525}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_42}, doi = {10.1007/11523468\_42}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/DrosteG05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/EfthymiouS05, author = {Charilaos Efthymiou and Paul G. Spirakis}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {On the Existence of Hamiltonian Cycles in Random Intersection Graphs}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {690--701}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_56}, doi = {10.1007/11523468\_56}, timestamp = {Wed, 28 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/EfthymiouS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/EisenbrandGOS05, author = {Friedrich Eisenbrand and Fabrizio Grandoni and Gianpaolo Oriolo and Martin Skutella}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {New Approaches for Virtual Private Network Design}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1151--1162}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_93}, doi = {10.1007/11523468\_93}, timestamp = {Mon, 11 Dec 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/EisenbrandGOS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/ElbassioniFMS05, author = {Khaled M. Elbassioni and Aleksei V. Fishkin and Nabil H. Mustafa and Ren{\'{e}} Sitters}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Approximation Algorithms for Euclidean Group {TSP}}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1115--1126}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_90}, doi = {10.1007/11523468\_90}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/ElbassioniFMS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/EliasL05, author = {Isaac Elias and Jens Lagergren}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Fast Neighbor Joining}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1263--1274}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_102}, doi = {10.1007/11523468\_102}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/EliasL05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/EnglertW05, author = {Matthias Englert and Matthias Westermann}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Reordering Buffer Management for Non-uniform Cost Models}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {627--638}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_51}, doi = {10.1007/11523468\_51}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/EnglertW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/EpsteinL05, author = {Leah Epstein and Meital Levy}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Online Interval Coloring and Variants}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {602--613}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_49}, doi = {10.1007/11523468\_49}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/EpsteinL05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/EtessamiY05, author = {Kousha Etessami and Mihalis Yannakakis}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Recursive Markov Decision Processes and Recursive Stochastic Games}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {891--903}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_72}, doi = {10.1007/11523468\_72}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/EtessamiY05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Farach-ColtonLST05, author = {Martin Farach{-}Colton and Gad M. Landau and S{\"{u}}leyman Cenk Sahinalp and Dekel Tsur}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Optimal Spaced Seeds for Faster Approximate String Matching}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1251--1262}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_101}, doi = {10.1007/11523468\_101}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Farach-ColtonLST05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/FialaGK05, author = {Jir{\'{\i}} Fiala and Petr A. Golovach and Jan Kratochv{\'{\i}}l}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Distance Constrained Labelings of Graphs of Bounded Treewidth}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {360--372}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_30}, doi = {10.1007/11523468\_30}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/FialaGK05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Fischlin05, author = {Marc Fischlin}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Completely Non-malleable Schemes}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {779--790}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_63}, doi = {10.1007/11523468\_63}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/Fischlin05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/FokkinkN05, author = {Wan J. Fokkink and Sumit Nain}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {A Finite Basis for Failure Semantics}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {755--765}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_61}, doi = {10.1007/11523468\_61}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/FokkinkN05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/FominGK05, author = {Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Measure and Conquer: Domination - {A} Case Study}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {191--203}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_16}, doi = {10.1007/11523468\_16}, timestamp = {Mon, 11 Dec 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/FominGK05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/FordG05, author = {Jeff Ford and Anna G{\'{a}}l}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1163--1175}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_94}, doi = {10.1007/11523468\_94}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/FordG05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/FranceschiniG05, author = {Gianni Franceschini and Roberto Grossi}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Optimal In-place Sorting of Vectors and Records}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {90--102}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_8}, doi = {10.1007/11523468\_8}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/FranceschiniG05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/GairingLMT05, author = {Martin Gairing and Thomas L{\"{u}}cking and Burkhard Monien and Karsten Tiemann}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {51--65}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_5}, doi = {10.1007/11523468\_5}, timestamp = {Tue, 26 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/GairingLMT05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/GairingMW05, author = {Martin Gairing and Burkhard Monien and Andreas Woclaw}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {828--839}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_67}, doi = {10.1007/11523468\_67}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/GairingMW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Galindo05, author = {David Galindo}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Boneh-Franklin Identity Based Encryption Revisited}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {791--802}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_64}, doi = {10.1007/11523468\_64}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/Galindo05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/GentryR05, author = {Craig Gentry and Zulfikar Ramzan}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Single-Database Private Information Retrieval with Constant Communication Rate}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {803--815}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_65}, doi = {10.1007/11523468\_65}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/GentryR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/GroheKS05, author = {Martin Grohe and Christoph Koch and Nicole Schweikardt}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Tight Lower Bounds for Query Processing on Streaming and External Memory Data}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1076--1088}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_87}, doi = {10.1007/11523468\_87}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/GroheKS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/GuT05, author = {Qian{-}Ping Gu and Hisao Tamaki}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Optimal Branch-Decomposition of Planar Graphs in \emph{O}(\emph{n}\({}^{\mbox{3}}\)) Time}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {373--384}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_31}, doi = {10.1007/11523468\_31}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/GuT05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/GuptaP05, author = {Anupam Gupta and Martin P{\'{a}}l}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Stochastic Steiner Trees Without a Root}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1051--1063}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_85}, doi = {10.1007/11523468\_85}, timestamp = {Wed, 18 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/GuptaP05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/HanedaKT05, author = {Mitsuhiro Haneda and Mitsuru Kawazoe and Tetsuya Takahashi}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Suitable Curves for Genus-4 {HCC} over Prime Fields: Point Counting Formulae for Hyperelliptic Curves of Type \emph{y}\({}^{\mbox{2}}\)=\emph{x}\({}^{\mbox{2\emph{k}+1}}\)+\emph{ax}}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {539--550}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_44}, doi = {10.1007/11523468\_44}, timestamp = {Tue, 12 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/HanedaKT05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Hast05, author = {Gustav Hast}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Approximating - Outperforming a Random Assignment with Almost a Linear Factor}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {956--968}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_77}, doi = {10.1007/11523468\_77}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Hast05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Hopper05, author = {Nicholas Hopper}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {On Steganographic Chosen Covertext Security}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {311--323}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_26}, doi = {10.1007/11523468\_26}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Hopper05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/HorvitzK05, author = {Omer Horvitz and Jonathan Katz}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Bounds on the Efficiency of "Black-Box" Commitment Schemes}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {128--139}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_11}, doi = {10.1007/11523468\_11}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/HorvitzK05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/HromkovicS05, author = {Juraj Hromkovic and Georg Schnitger}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {NFAs With and Without \emph{epsilon}-Transitions}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {385--396}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_32}, doi = {10.1007/11523468\_32}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/HromkovicS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/JainHT05, author = {Kamal Jain and Mohammad Taghi Hajiaghayi and Kunal Talwar}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {The Generalized Deadlock Resolution Problem}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {853--865}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_69}, doi = {10.1007/11523468\_69}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/JainHT05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/JampalaZ05, author = {Hema Jampala and Norbert Zeh}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Cache-Oblivious Planar Shortest Paths}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {563--575}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_46}, doi = {10.1007/11523468\_46}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/JampalaZ05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/KaligosiMMS05, author = {Kanela Kaligosi and Kurt Mehlhorn and J. Ian Munro and Peter Sanders}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Towards Optimal Multiple Selection}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {103--114}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_9}, doi = {10.1007/11523468\_9}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/KaligosiMMS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/KaoSS05, author = {Ming{-}Yang Kao and Manan Sanghi and Robert T. Schweller}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Randomized Fast Design of Short {DNA} Words}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1275--1286}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_103}, doi = {10.1007/11523468\_103}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/KaoSS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Karakostas05, author = {George Karakostas}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {A Better Approximation Ratio for the Vertex Cover Problem}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1043--1050}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_84}, doi = {10.1007/11523468\_84}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Karakostas05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Kavitha05, author = {Telikepalli Kavitha}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {An {\~{O}}(\emph{m}\({}^{\mbox{2}}\)\emph{n}) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {273--284}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_23}, doi = {10.1007/11523468\_23}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Kavitha05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Kayal05, author = {Neeraj Kayal}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Solvability of a System of Bivariate Polynomial Equations over a Finite Field}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {551--562}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_45}, doi = {10.1007/11523468\_45}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Kayal05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/KempeKT05, author = {David Kempe and Jon M. Kleinberg and {\'{E}}va Tardos}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Influential Nodes in a Diffusion Model for Social Networks}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1127--1138}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_91}, doi = {10.1007/11523468\_91}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/KempeKT05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/KiltzMPR05, author = {Eike Kiltz and Anton Mityagin and Saurabh Panjwani and Barath Raghavan}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Append-Only Signatures}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {434--445}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_36}, doi = {10.1007/11523468\_36}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/KiltzMPR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/KnapikNUW05, author = {Teodor Knapik and Damian Niwinski and Pawel Urzyczyn and Igor Walukiewicz}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Unsafe Grammars and Panic Automata}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1450--1461}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_117}, doi = {10.1007/11523468\_117}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/KnapikNUW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/KoiranNP05, author = {Pascal Koiran and Vincent Nesme and Natacha Portier}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {A Quantum Lower Bound for the Query Complexity of Simon's Problem}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1287--1298}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_104}, doi = {10.1007/11523468\_104}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/KoiranNP05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/KonemannLSZ05, author = {Jochen K{\"{o}}nemann and Stefano Leonardi and Guido Sch{\"{a}}fer and Stefan H. M. van Zwam}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {From Primal-Dual to Cost Shares and Back: {A} Stronger {LP} Relaxation for the Steiner Forest Problem}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {930--942}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_75}, doi = {10.1007/11523468\_75}, timestamp = {Tue, 27 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/KonemannLSZ05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Kovacs05, author = {Annam{\'{a}}ria Kov{\'{a}}cs}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Polynomial Time Preemptive Sum-Multicoloring on Paths}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {840--852}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_68}, doi = {10.1007/11523468\_68}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Kovacs05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/KowalukL05, author = {Miroslaw Kowaluk and Andrzej Lingas}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {{LCA} Queries in Directed Acyclic Graphs}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {241--248}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_20}, doi = {10.1007/11523468\_20}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/KowalukL05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/KumarSS05, author = {Amit Kumar and Yogish Sabharwal and Sandeep Sen}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Linear Time Algorithms for Clustering Problems in Any Dimensions}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1374--1385}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_111}, doi = {10.1007/11523468\_111}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/KumarSS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/KursaweS05, author = {Klaus Kursawe and Victor Shoup}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Optimistic Asynchronous Atomic Broadcast}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {204--215}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_17}, doi = {10.1007/11523468\_17}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/KursaweS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Laird05, author = {James Laird}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Decidability in Syntactic Control of Interference}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {904--916}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_73}, doi = {10.1007/11523468\_73}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Laird05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/LiDIY05, author = {Cheng Li and Zhe Dang and Oscar H. Ibarra and Hsu{-}Chun Yen}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Signaling {P} Systems and Verification Problems}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1462--1473}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_118}, doi = {10.1007/11523468\_118}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/LiDIY05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Libkin05, author = {Leonid Libkin}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Logics for Unranked Trees: An Overview}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {35--50}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_4}, doi = {10.1007/11523468\_4}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Libkin05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/LinRTW05, author = {Henry C. Lin and Tim Roughgarden and {\'{E}}va Tardos and Asher Walkover}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Braess's Paradox, Fibonacci Numbers, and Exponential Inapproximability}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {497--512}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_41}, doi = {10.1007/11523468\_41}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/LinRTW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/LipmaaWB05, author = {Helger Lipmaa and Guilin Wang and Feng Bao}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Designated Verifier Signature Schemes: Attacks, New Security Notions and a New Construction}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {459--471}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_38}, doi = {10.1007/11523468\_38}, timestamp = {Mon, 06 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/LipmaaWB05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/MagniezN05, author = {Fr{\'{e}}d{\'{e}}ric Magniez and Ashwin Nayak}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Quantum Complexity of Testing Group Commutativity}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1312--1324}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_106}, doi = {10.1007/11523468\_106}, timestamp = {Mon, 18 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/MagniezN05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/MaurerS05, author = {Ueli M. Maurer and Johan Sj{\"{o}}din}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Single-Key AIL-MACs from Any {FIL-MAC}}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {472--484}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_39}, doi = {10.1007/11523468\_39}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/MaurerS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Mislove05, author = {Michael W. Mislove}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Discrete Random Variables over Domains}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1006--1017}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_81}, doi = {10.1007/11523468\_81}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/Mislove05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/MoranN05, author = {Tal Moran and Moni Naor}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Basing Cryptographic Protocols on Tamper-Evident Seals}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {285--297}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_24}, doi = {10.1007/11523468\_24}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/MoranN05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/MousaviR05, author = {Mohammad Reza Mousavi and Michel A. Reniers}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Orthogonal Extensions in Structural Operational Semantics}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1214--1225}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_98}, doi = {10.1007/11523468\_98}, timestamp = {Sat, 11 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/MousaviR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/MurawskiOW05, author = {Andrzej S. Murawski and C.{-}H. Luke Ong and Igor Walukiewicz}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Idealized Algol with Ground Recursion, and {DPDA} Equivalence}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {917--929}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_74}, doi = {10.1007/11523468\_74}, timestamp = {Sun, 04 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/MurawskiOW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/NicolaGP05, author = {Rocco De Nicola and Daniele Gorla and Rosario Pugliese}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Basic Observables for a Calculus for Global Computing}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1226--1238}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_99}, doi = {10.1007/11523468\_99}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/NicolaGP05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Nilsson05, author = {Bengt J. Nilsson}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Approximate Guarding of Monotone and Rectilinear Polygons}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1362--1373}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_110}, doi = {10.1007/11523468\_110}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Nilsson05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/PatrascuP05, author = {Corina E. Patrascu and Mihai P{u{a}}tra{c{s}}cu}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {On Dynamic Bit-Probe Complexity}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {969--981}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_78}, doi = {10.1007/11523468\_78}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/PatrascuP05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/PemmarajuR05, author = {Sriram V. Pemmaraju and Rajiv Raman}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Approximation Algorithms for the Max-coloring Problem}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1064--1075}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_86}, doi = {10.1007/11523468\_86}, timestamp = {Mon, 17 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/PemmarajuR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/PersianoV05, author = {Giuseppe Persiano and Ivan Visconti}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Single-Prover Concurrent Zero Knowledge in Almost Constant Rounds}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {228--240}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_19}, doi = {10.1007/11523468\_19}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/PersianoV05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Pous05, author = {Damien Pous}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Up-to Techniques for Weak Bisimulation}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {730--741}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_59}, doi = {10.1007/11523468\_59}, timestamp = {Thu, 15 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Pous05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/PredaG05, author = {Mila Dalla Preda and Roberto Giacobazzi}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Semantic-Based Code Obfuscation by Abstract Interpretation}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1325--1336}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_107}, doi = {10.1007/11523468\_107}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/PredaG05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/RadhakrishnanRS05, author = {Jaikumar Radhakrishnan and Martin R{\"{o}}tteler and Pranab Sen}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1399--1411}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_113}, doi = {10.1007/11523468\_113}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/RadhakrishnanRS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/ReusS05, author = {Bernhard Reus and Thomas Streicher}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {About Hoare Logics for Higher-Order Store}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1337--1348}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_108}, doi = {10.1007/11523468\_108}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/ReusS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/RodittyTZ05, author = {Liam Roditty and Mikkel Thorup and Uri Zwick}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Deterministic Constructions of Approximate Distance Oracles and Spanners}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {261--272}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_22}, doi = {10.1007/11523468\_22}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/RodittyTZ05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/RodittyZ05, author = {Liam Roditty and Uri Zwick}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Replacement Paths and \emph{k} Simple Shortest Paths in Unweighted Directed Graphs}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {249--260}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_21}, doi = {10.1007/11523468\_21}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/RodittyZ05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/SpalekS05, author = {Robert Spalek and Mario Szegedy}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {All Quantum Adversary Methods Are Equivalent}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1299--1311}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_105}, doi = {10.1007/11523468\_105}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/SpalekS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/TamassiaT05, author = {Roberto Tamassia and Nikos Triandopoulos}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Computational Bounds on Hierarchical Data Processing with Applications to Information Security}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {153--165}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_13}, doi = {10.1007/11523468\_13}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/TamassiaT05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/TessonT05, author = {Pascal Tesson and Denis Th{\'{e}}rien}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Restricted Two-Variable Sentences, Circuits and Communication Complexity}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {526--538}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_43}, doi = {10.1007/11523468\_43}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/TessonT05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/TrolinW05, author = {M{\aa}rten Trolin and Douglas Wikstr{\"{o}}m}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Hierarchical Group Signatures}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {446--458}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_37}, doi = {10.1007/11523468\_37}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/TrolinW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Valiant05, author = {Leslie G. Valiant}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Holographic Circuits}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1--15}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_1}, doi = {10.1007/11523468\_1}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Valiant05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Wee05, author = {Hoeteck Wee}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {On Round-Efficient Argument Systems}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {140--152}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_12}, doi = {10.1007/11523468\_12}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Wee05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Wegener05, author = {Ingo Wegener}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Simulated Annealing Beats Metropolis in Combinatorial Optimization}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {589--601}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_48}, doi = {10.1007/11523468\_48}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Wegener05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/WehnerW05, author = {Stephanie Wehner and Ronald de Wolf}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1424--1436}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_115}, doi = {10.1007/11523468\_115}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/WehnerW05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Wikstrom05, author = {Douglas Wikstr{\"{o}}m}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {On the \emph{l}-Ary GCD-Algorithm in Rings of Integers}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1189--1201}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_96}, doi = {10.1007/11523468\_96}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Wikstrom05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Zhang05, author = {Li Zhang}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {The Efficiency and Fairness of a Fixed Budget Resource Allocation Game}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {485--496}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_40}, doi = {10.1007/11523468\_40}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Zhang05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Zimand05, author = {Marius Zimand}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Simple Extractors via Constructions of Cryptographic Pseudo-random Generators}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {115--127}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_10}, doi = {10.1007/11523468\_10}, timestamp = {Tue, 23 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Zimand05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/icalp/2005, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468}, doi = {10.1007/11523468}, isbn = {3-540-27580-0}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/2005.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/CaryRS05, title = {On the Hardness of Embeddings Between Two Finite Metrics}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {1412--1423}, publisher = {Springer}, year = {2005}, note = {Withdrawn.}, url = {https://doi.org/10.1007/11523468\_114}, doi = {10.1007/11523468\_114}, timestamp = {Fri, 12 Oct 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/CaryRS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.