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/journals/algorithmica/algorithmica34.bht:"
download as .bib file
@article{DBLP:journals/algorithmica/AgbariaBN02,
author = {Adnan Agbaria and
Yosi Ben{-}Asher and
Ilan Newman},
title = {Communication - Processor Tradeoffs in a Limited Resources {PRAM}},
journal = {Algorithmica},
volume = {34},
number = {3},
pages = {276--297},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0966-5},
doi = {10.1007/S00453-002-0966-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AgbariaBN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AndrewsZ02,
author = {Matthew Andrews and
Lisa Zhang},
title = {Approximation Algorithms for Access Network Design},
journal = {Algorithmica},
volume = {34},
number = {2},
pages = {197--215},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0968-3},
doi = {10.1007/S00453-002-0968-3},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AndrewsZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AzarBFLNE02,
author = {Yossi Azar and
Joan Boyar and
Lene M. Favrholdt and
Kim S. Larsen and
Morten N. Nielsen and
Leah Epstein},
title = {Fair versus Unrestricted Bin Packing},
journal = {Algorithmica},
volume = {34},
number = {2},
pages = {181--196},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0965-6},
doi = {10.1007/S00453-002-0965-6},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/AzarBFLNE02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BandyopadhyayBRV02,
author = {Somshubhro Bandyopadhyay and
P. Oscar Boykin and
Vwani P. Roychowdhury and
Farrokh Vatan},
title = {A New Proof for the Existence of Mutually Unbiased Bases},
journal = {Algorithmica},
volume = {34},
number = {4},
pages = {512--528},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0980-7},
doi = {10.1007/S00453-002-0980-7},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BandyopadhyayBRV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BaswanaS02,
author = {Surender Baswana and
Sandeep Sen},
title = {Planar Graph Blocking for External Searching},
journal = {Algorithmica},
volume = {34},
number = {3},
pages = {298--308},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0969-2},
doi = {10.1007/S00453-002-0969-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BaswanaS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BeaudrapCW02,
author = {J. Niel de Beaudrap and
Richard Cleve and
John Watrous},
title = {Sharp Quantum versus Classical Query Complexity Separations},
journal = {Algorithmica},
volume = {34},
number = {4},
pages = {449--461},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0978-1},
doi = {10.1007/S00453-002-0978-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BeaudrapCW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BeaumontBRR02,
author = {Olivier Beaumont and
Vincent Boudet and
Fabrice Rastello and
Yves Robert},
title = {Partitioning a Square into Rectangles: NP-Completeness and Approximation
Algorithms},
journal = {Algorithmica},
volume = {34},
number = {3},
pages = {217--239},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0962-9},
doi = {10.1007/S00453-002-0962-9},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BeaumontBRR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Benioff02,
author = {Paul Benioff},
title = {The Representation of Numbers in Quantum Mechanics},
journal = {Algorithmica},
volume = {34},
number = {4},
pages = {529--559},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0982-5},
doi = {10.1007/S00453-002-0982-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Benioff02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BergSVK02,
author = {Mark de Berg and
A. Frank van der Stappen and
Jules Vleugels and
Matthew J. Katz},
title = {Realistic Input Models for Geometric Algorithms},
journal = {Algorithmica},
volume = {34},
number = {1},
pages = {81--97},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0961-x},
doi = {10.1007/S00453-002-0961-X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BergSVK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BihamBBGM02,
author = {Eli Biham and
Michel Boyer and
Gilles Brassard and
Jeroen van de Graaf and
Tal Mor},
title = {Security of Quantum Key Distribution against All Collective Attacks},
journal = {Algorithmica},
volume = {34},
number = {4},
pages = {372--388},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0973-6},
doi = {10.1007/S00453-002-0973-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BihamBBGM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoissonnatGKL02,
author = {Jean{-}Daniel Boissonnat and
Subir Kumar Ghosh and
Telikepalli Kavitha and
Sylvain Lazard},
title = {An Algorithm for Computing a Convex and Simple Path of Bounded Curvature
in a Simple Polygon},
journal = {Algorithmica},
volume = {34},
number = {2},
pages = {109--156},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0950-0},
doi = {10.1007/S00453-002-0950-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BoissonnatGKL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Brun02,
author = {Todd A. Brun},
title = {Remotely Prepared Entanglement: a Quantum Web Page},
journal = {Algorithmica},
volume = {34},
number = {4},
pages = {502--511},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0974-5},
doi = {10.1007/S00453-002-0974-5},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Brun02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Chan02,
author = {Timothy M. Chan},
title = {A Near-Linear Area Bound for Drawing Binary Trees},
journal = {Algorithmica},
volume = {34},
number = {1},
pages = {1--13},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0937-x},
doi = {10.1007/S00453-002-0937-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Chan02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChazelleDHMST02,
author = {Bernard Chazelle and
Olivier Devillers and
Ferran Hurtado and
Merc{\`{e}} Mora and
Vera Sacrist{\'{a}}n and
Monique Teillaud},
title = {Splitting a Delaunay Triangulation in Linear Time},
journal = {Algorithmica},
volume = {34},
number = {1},
pages = {39--46},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0939-8},
doi = {10.1007/S00453-002-0939-8},
timestamp = {Fri, 15 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ChazelleDHMST02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ChenBSS02,
author = {Chunhong Chen and
Elaheh Bozorgzadeh and
Ankur Srivastava and
Majid Sarrafzadeh},
title = {Budget Management with Applications},
journal = {Algorithmica},
volume = {34},
number = {3},
pages = {261--275},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0964-7},
doi = {10.1007/S00453-002-0964-7},
timestamp = {Thu, 18 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ChenBSS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Dam02,
author = {Wim van Dam},
title = {Quantum Algorithms for Weighing Matrices and Quadratic Residues},
journal = {Algorithmica},
volume = {34},
number = {4},
pages = {413--428},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0975-4},
doi = {10.1007/S00453-002-0975-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Dam02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FeigenbaumKSV02,
author = {Joan Feigenbaum and
Sampath Kannan and
Martin Strauss and
Mahesh Viswanathan},
title = {Testing and Spot-Checking of Data Streams},
journal = {Algorithmica},
volume = {34},
number = {1},
pages = {67--80},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0959-4},
doi = {10.1007/S00453-002-0959-4},
timestamp = {Tue, 19 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FeigenbaumKSV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FishburnL02,
author = {Peter C. Fishburn and
J. C. Lagarias},
title = {Pinwheel Scheduling: Achievable Densities},
journal = {Algorithmica},
volume = {34},
number = {1},
pages = {14--38},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0938-9},
doi = {10.1007/S00453-002-0938-9},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FishburnL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GilbertH02,
author = {Gerald Gilbert and
Michael Hamrick},
title = {Secrecy, Computational Loads and Rates in Practical Quantum Cryptography},
journal = {Algorithmica},
volume = {34},
number = {4},
pages = {314--339},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0977-2},
doi = {10.1007/S00453-002-0977-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GilbertH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GisinRW02,
author = {Nicolas Gisin and
Renato Renner and
Stefan Wolf},
title = {Linking Classical and Quantum Key Agreement: Is There a Classical
Analog to Bound Entanglement?},
journal = {Algorithmica},
volume = {34},
number = {4},
pages = {389--412},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0972-7},
doi = {10.1007/S00453-002-0972-7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GisinRW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HayesKM02,
author = {Thomas P. Hayes and
Samuel Kutin and
Dieter van Melkebeek},
title = {The Quantum Black-Box Complexity of Majority},
journal = {Algorithmica},
volume = {34},
number = {4},
pages = {480--501},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0981-6},
doi = {10.1007/S00453-002-0981-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HayesKM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HoyerNS02,
author = {Peter H{\o}yer and
Jan Neerbek and
Yaoyun Shi},
title = {Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness},
journal = {Algorithmica},
volume = {34},
number = {4},
pages = {429--448},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0976-3},
doi = {10.1007/S00453-002-0976-3},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HoyerNS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Inamori02,
author = {Hitoshi Inamori},
title = {Security of Practical Time-Reversed {EPR} Quantum Key Distribution},
journal = {Algorithmica},
volume = {34},
number = {4},
pages = {340--365},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0983-4},
doi = {10.1007/S00453-002-0983-4},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Inamori02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Inamori02a,
author = {Hitoshi Inamori},
title = {Security of Practical {BB84} Quantum Key Distribution},
journal = {Algorithmica},
volume = {34},
number = {4},
pages = {366--371},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0984-3},
doi = {10.1007/S00453-002-0984-3},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Inamori02a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/JansenW02,
author = {Thomas Jansen and
Ingo Wegener},
title = {The Analysis of Evolutionary Algorithms - {A} Proof That Crossover
Really Can Help},
journal = {Algorithmica},
volume = {34},
number = {1},
pages = {47--66},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0940-2},
doi = {10.1007/S00453-002-0940-2},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/JansenW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MakinoYK02,
author = {Kazuhisa Makino and
Masafumi Yamashita and
Tiko Kameda},
title = {Max- and Min-Neighborhood Monopolies},
journal = {Algorithmica},
volume = {34},
number = {3},
pages = {240--260},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0963-8},
doi = {10.1007/S00453-002-0963-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MakinoYK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MoscaT02,
author = {Michele Mosca and
Alain Tapp},
title = {Introduction},
journal = {Algorithmica},
volume = {34},
number = {4},
pages = {309--313},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0971-8},
doi = {10.1007/S00453-002-0971-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MoscaT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/PisantiS02,
author = {Nadia Pisanti and
Marie{-}France Sagot},
title = {Further Thoughts on the Syntenic Distance between Genomes},
journal = {Algorithmica},
volume = {34},
number = {2},
pages = {157--180},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0960-y},
doi = {10.1007/S00453-002-0960-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/PisantiS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RadhakrishnanSV02,
author = {Jaikumar Radhakrishnan and
Pranab Sen and
Srinivasan Venkatesh},
title = {The Quantum Complexity of Set Membership},
journal = {Algorithmica},
volume = {34},
number = {4},
pages = {462--479},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0979-0},
doi = {10.1007/S00453-002-0979-0},
timestamp = {Thu, 21 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/RadhakrishnanSV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RaviW02,
author = {R. Ravi and
David P. Williamson},
title = {Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity
Problems},
journal = {Algorithmica},
volume = {34},
number = {1},
pages = {98--107},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0970-9},
doi = {10.1007/S00453-002-0970-9},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RaviW02.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-25 03:17 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:
