Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/ciac/ciac2003.bht:"
download as .bib file
@inproceedings{DBLP:conf/ciac/AertsKS03,
author = {Joep Aerts and
Jan H. M. Korst and
Frits C. R. Spieksma},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Approximation of a Retrieval Problem for Parallel Disks},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {178--188},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_23},
doi = {10.1007/3-540-44849-7\_23},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/AertsKS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/AmanoM03,
author = {Kazuyuki Amano and
Akira Maruoka},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Some Properties of MOD\({}_{\mbox{m}}\) Circuits Computing Simple
Functions},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {227--237},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_27},
doi = {10.1007/3-540-44849-7\_27},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/AmanoM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BaltzS03,
author = {Andreas Baltz and
Anand Srivastav},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Fast Approximation of Minimum Multicast Congestion - Implementation
versus Theory},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {165--177},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_22},
doi = {10.1007/3-540-44849-7\_22},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BaltzS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BazganHM03,
author = {Cristina Bazgan and
Refael Hassin and
J{\'{e}}r{\^{o}}me Monnot},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Differential Approximation for Some Routing Problems},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {277--288},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_31},
doi = {10.1007/3-540-44849-7\_31},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BazganHM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BishnuDNB03,
author = {Arijit Bishnu and
Sandip Das and
Subhas C. Nandy and
Bhargab B. Bhattacharya},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {An Improved Algorithm for Point Set Pattern Matching under Rigid Motion},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {36--45},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_11},
doi = {10.1007/3-540-44849-7\_11},
timestamp = {Sun, 24 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BishnuDNB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BockenhauerBHKPSU03,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Dirk Bongartz and
Juraj Hromkovic and
Ralf Klasing and
Guido Proietti and
Sebastian Seibert and
Walter Unger},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {On k-Edge-Connectivity Problems with Sharpened Triangle Inequality},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {189--200},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_24},
doi = {10.1007/3-540-44849-7\_24},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BockenhauerBHKPSU03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BongiovanniP03,
author = {Gian Carlo Bongiovanni and
Paolo Penna},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {XOR-Based Schemes for Fast Parallel {IP} Lookups},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {238--250},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_28},
doi = {10.1007/3-540-44849-7\_28},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BongiovanniP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BonizzoniVD03,
author = {Paola Bonizzoni and
Gianluca Della Vedova and
Riccardo Dondi},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Reconciling Gene Trees to a Species Tree},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {120--131},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_18},
doi = {10.1007/3-540-44849-7\_18},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BonizzoniVD03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BoyarF03,
author = {Joan Boyar and
Lene M. Favrholdt},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {The Relative Worst Order Ratio for On-Line Algorithms},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {58--69},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_13},
doi = {10.1007/3-540-44849-7\_13},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BoyarF03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BruceHKR03,
author = {Richard Bruce and
Michael Hoffmann and
Danny Krizanc and
Rajeev Raman},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Efficient Update Strategies for Geometric Computing with Uncertainty},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {12--23},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_9},
doi = {10.1007/3-540-44849-7\_9},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/BruceHKR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChanLTW03,
author = {Wun{-}Tat Chan and
Tak Wah Lam and
Hing{-}Fung Ting and
Prudence W. H. Wong},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {On-Line Stream Merging, Max Span, and Min Coverage},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {70--82},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_14},
doi = {10.1007/3-540-44849-7\_14},
timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ChanLTW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChepoiDY03,
author = {Victor Chepoi and
Feodor F. Dragan and
Chenyu Yan},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Additive Spanners for k-Chordal Graphs},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {96--107},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_16},
doi = {10.1007/3-540-44849-7\_16},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ChepoiDY03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/ChlebikC03,
author = {Miroslav Chleb{\'{\i}}k and
Janka Chleb{\'{\i}}kov{\'{a}}},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Approximation Hardness for Small Occurrence Instances of NP-Hard Problems},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {152--164},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_21},
doi = {10.1007/3-540-44849-7\_21},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ChlebikC03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/DuckworthM03,
author = {William Duckworth and
Bernard Mans},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Randomised Algorithms for Finding Small Weakly-Connected Dominating
Sets of Regular Graphs},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {83--95},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_15},
doi = {10.1007/3-540-44849-7\_15},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/DuckworthM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GabrieleMRS03,
author = {Alessandra Gabriele and
Filippo Mignosi and
Antonio Restivo and
Marinella Sciortino},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Indexing Structures for Approximate String Matching},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {140--151},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_20},
doi = {10.1007/3-540-44849-7\_20},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GabrieleMRS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GrammGHN03,
author = {Jens Gramm and
Jiong Guo and
Falk H{\"{u}}ffner and
Rolf Niedermeier},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique
Generation},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {108--119},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_17},
doi = {10.1007/3-540-44849-7\_17},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GrammGHN03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/HolzapfelKMT03,
author = {Klaus Holzapfel and
Sven Kosub and
Moritz G. Maa{\ss} and
Hanjo T{\"{a}}ubig},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {The Complexity of Detecting Fixed-Density Clusters},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {201--212},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_25},
doi = {10.1007/3-540-44849-7\_25},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/HolzapfelKMT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KalyanasundaramVW03,
author = {Bala Kalyanasundaram and
Mahendran Velauthapillai and
John G. Waclawsky},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Unlocking the Advantages of Dynamic Service Selection and Pricing},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {46--57},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_12},
doi = {10.1007/3-540-44849-7\_12},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KalyanasundaramVW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KoukopoulosMNS03,
author = {Dimitrios Koukopoulos and
Marios Mavronicolas and
Sotiris E. Nikoletseas and
Paul G. Spirakis},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {The Impact of Network Structure on the Stability of Greedy Protocols},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {251--263},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_29},
doi = {10.1007/3-540-44849-7\_29},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KoukopoulosMNS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KranakisPSTW03,
author = {Evangelos Kranakis and
Paolo Penna and
Konrad Schlude and
David Scot Taylor and
Peter Widmayer},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Improving Customer Proximity to Railway Stations},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {264--276},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_30},
doi = {10.1007/3-540-44849-7\_30},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KranakisPSTW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Leiserson03,
author = {Charles E. Leiserson},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Cache-Oblivious Algorithms},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {5},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_5},
doi = {10.1007/3-540-44849-7\_5},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Leiserson03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/MarkouZF03,
author = {Euripides Markou and
Stathis Zachos and
Christodoulos Fragoudakis},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {24--35},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_10},
doi = {10.1007/3-540-44849-7\_10},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/MarkouZF03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Peleg03,
author = {David Peleg},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Localized Network Representations},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {1},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_1},
doi = {10.1007/3-540-44849-7\_1},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Peleg03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Peleg03a,
author = {David Peleg},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Spanning Trees with Low Maximum/Average Stretch},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {6},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_6},
doi = {10.1007/3-540-44849-7\_6},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Peleg03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Rabin03,
author = {Michael O. Rabin},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Hyper Encryption and Everlasting Secrets},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {7--10},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_7},
doi = {10.1007/3-540-44849-7\_7},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Rabin03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Savage03,
author = {John E. Savage},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Computing with Electronic Nanotechnologies},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {11},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_8},
doi = {10.1007/3-540-44849-7\_8},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Savage03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Szwarcfiter03,
author = {Jayme Luiz Szwarcfiter},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Optimal Binary Search Trees with Costs Depending on the Access Paths},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {2},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_2},
doi = {10.1007/3-540-44849-7\_2},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Szwarcfiter03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Szwarcfiter03a,
author = {Jayme Luiz Szwarcfiter},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {On the Generation of Extensions of a Partially Ordered Set},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {3},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_3},
doi = {10.1007/3-540-44849-7\_3},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Szwarcfiter03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Szwarcfiter03b,
author = {Jayme Luiz Szwarcfiter},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Generating All Forest Extensions of a Partially Ordered Set},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {132--139},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_19},
doi = {10.1007/3-540-44849-7\_19},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Szwarcfiter03b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Trevisan03,
author = {Luca Trevisan},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Error-Correcting Codes in Complexity Theory},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {4},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_4},
doi = {10.1007/3-540-44849-7\_4},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Trevisan03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Yamakami03,
author = {Tomoyuki Yamakami},
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Nearly Bounded Error Probabilistic Sets},
booktitle = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
pages = {213--226},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7\_26},
doi = {10.1007/3-540-44849-7\_26},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Yamakami03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/2003,
editor = {Rossella Petreschi and
Giuseppe Persiano and
Riccardo Silvestri},
title = {Algorithms and Complexity, 5th Italian Conference, {CIAC} 2003, Rome,
Italy, May 28-30, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2653},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-44849-7},
doi = {10.1007/3-540-44849-7},
isbn = {3-540-40176-8},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/2003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-04-19 05:46 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
