![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/algorithmica/algorithmica46.bht:"
@article{DBLP:journals/algorithmica/AmanoM06, author = {Kazuyuki Amano and Akira Maruoka}, title = {The Monotone Circuit Complexity of Quadratic Boolean Functions}, journal = {Algorithmica}, volume = {46}, number = {1}, pages = {3--14}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0073-0}, doi = {10.1007/S00453-006-0073-0}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/AmanoM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/ArkinBFMS06, author = {Esther M. Arkin and Michael A. Bender and S{\'{a}}ndor P. Fekete and Joseph S. B. Mitchell and Martin Skutella}, title = {The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots}, journal = {Algorithmica}, volume = {46}, number = {2}, pages = {193--221}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-1206-1}, doi = {10.1007/S00453-006-1206-1}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/ArkinBFMS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/ArmonZ06, author = {Amitai Armon and Uri Zwick}, title = {Multicriteria Global Minimum Cuts}, journal = {Algorithmica}, volume = {46}, number = {1}, pages = {15--26}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0068-x}, doi = {10.1007/S00453-006-0068-X}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/ArmonZ06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/AvanziHP06, author = {Roberto Maria Avanzi and Clemens Heuberger and Helmut Prodinger}, title = {Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and Mathematical Analysis}, journal = {Algorithmica}, volume = {46}, number = {3-4}, pages = {249--270}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0105-9}, doi = {10.1007/S00453-006-0105-9}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/AvanziHP06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BengtssonC06, author = {Fredrik Bengtsson and Jingsen Chen}, title = {Efficient Algorithms for k Maximum Sums}, journal = {Algorithmica}, volume = {46}, number = {1}, pages = {27--41}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0076-x}, doi = {10.1007/S00453-006-0076-X}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BengtssonC06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BroutinD06, author = {Nicolas Broutin and Luc Devroye}, title = {Large Deviations for the Weighted Height of an Extended Class of Trees}, journal = {Algorithmica}, volume = {46}, number = {3-4}, pages = {271--297}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0112-x}, doi = {10.1007/S00453-006-0112-X}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/BroutinD06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/CaiW06, author = {Jin{-}yi Cai and Osamu Watanabe}, title = {Random Access to Advice Strings and Collapsing Results}, journal = {Algorithmica}, volume = {46}, number = {1}, pages = {43--57}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0078-8}, doi = {10.1007/S00453-006-0078-8}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/CaiW06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/ChauvinD06, author = {Brigitte Chauvin and Michael Drmota}, title = {The Random Multisection Problem, Travelling Waves and the Distribution of the Height of m-Ary Search Trees}, journal = {Algorithmica}, volume = {46}, number = {3-4}, pages = {299--327}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0107-7}, doi = {10.1007/S00453-006-0107-7}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/ChauvinD06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/ChengH06, author = {Qi Cheng and Ming{-}Deh A. Huang}, title = {Partial Lifting and the Elliptic Curve Discrete Logarithm Problem}, journal = {Algorithmica}, volume = {46}, number = {1}, pages = {59--68}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0069-9}, doi = {10.1007/S00453-006-0069-9}, timestamp = {Tue, 18 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/ChengH06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/CorteelGH06, author = {Sylvie Corteel and William M. Y. Goh and Pawel Hitczenko}, title = {A Local Limit Theorem in the Theory of Overpartitions}, journal = {Algorithmica}, volume = {46}, number = {3-4}, pages = {329--343}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0102-z}, doi = {10.1007/S00453-006-0102-Z}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/CorteelGH06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/DessmarkFKP06, author = {Anders Dessmark and Pierre Fraigniaud and Dariusz R. Kowalski and Andrzej Pelc}, title = {Deterministic Rendezvous in Graphs}, journal = {Algorithmica}, volume = {46}, number = {1}, pages = {69--96}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0074-2}, doi = {10.1007/S00453-006-0074-2}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/DessmarkFKP06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/FigueiredoFSS06, author = {Celina M. H. de Figueiredo and Guilherme Dias da Fonseca and Vin{\'{\i}}cius G. P. de S{\'{a}} and Jeremy P. Spinrad}, title = {Algorithms for the Homogeneous Set Sandwich Problem}, journal = {Algorithmica}, volume = {46}, number = {2}, pages = {149--180}, year = {2006}, url = {https://doi.org/10.1007/s00453-005-1198-2}, doi = {10.1007/S00453-005-1198-2}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/FigueiredoFSS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/FillKP06, author = {James Allen Fill and Nevin Kapur and Alois Panholzer}, title = {Destruction of Very Simple Trees}, journal = {Algorithmica}, volume = {46}, number = {3-4}, pages = {345--366}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0100-1}, doi = {10.1007/S00453-006-0100-1}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/FillKP06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Fleischer06, author = {Rudolf Fleischer}, title = {Foreword}, journal = {Algorithmica}, volume = {46}, number = {1}, pages = {1}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0067-y}, doi = {10.1007/S00453-006-0067-Y}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Fleischer06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/FuchsHN06, author = {Michael Fuchs and Hsien{-}Kuei Hwang and Ralph Neininger}, title = {Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees}, journal = {Algorithmica}, volume = {46}, number = {3-4}, pages = {367--407}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0109-5}, doi = {10.1007/S00453-006-0109-5}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/FuchsHN06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/GathenS06, author = {Joachim von zur Gathen and Igor E. Shparlinski}, title = {{GCD} of Random Linear Combinations}, journal = {Algorithmica}, volume = {46}, number = {1}, pages = {137--148}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0072-1}, doi = {10.1007/S00453-006-0072-1}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/GathenS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/HansenSS06, author = {Jennie C. Hansen and Eric Schmutz and Li Sheng}, title = {The Expected Size of the Rule k Dominating Set}, journal = {Algorithmica}, volume = {46}, number = {3-4}, pages = {409--418}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0104-x}, doi = {10.1007/S00453-006-0104-X}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/HansenSS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/HershbergerSST06, author = {John Hershberger and Nisheeth Shrivastava and Subhash Suri and Csaba D. T{\'{o}}th}, title = {Adaptive Spatial Partitioning for Multidimensional Data Streams}, journal = {Algorithmica}, volume = {46}, number = {1}, pages = {97--117}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0070-3}, doi = {10.1007/S00453-006-0070-3}, timestamp = {Wed, 03 Jan 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/HershbergerSST06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/JacquetPS06, author = {Philippe Jacquet and Daniel Panario and Wojciech Szpankowski}, title = {Preface}, journal = {Algorithmica}, volume = {46}, number = {3-4}, pages = {247--248}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0139-z}, doi = {10.1007/S00453-006-0139-Z}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/JacquetPS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Janson06, author = {Svante Janson}, title = {Left and Right Pathlengths in Random Binary Trees}, journal = {Algorithmica}, volume = {46}, number = {3-4}, pages = {419--429}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0099-3}, doi = {10.1007/S00453-006-0099-3}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Janson06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/JanssonNSW06, author = {Jesper Jansson and See{-}Kiong Ng and Wing{-}Kin Sung and Hugo Willy}, title = {A Faster and More Space-Efficient Algorithm for Inferring Arc-Annotations of {RNA} Sequences through Alignment}, journal = {Algorithmica}, volume = {46}, number = {2}, pages = {223--245}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-1207-0}, doi = {10.1007/S00453-006-1207-0}, timestamp = {Tue, 17 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/JanssonNSW06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/LouchardP06, author = {Guy Louchard and Helmut Prodinger}, title = {Asymptotics of the Moments of Extreme-Value Related Distribution Functions}, journal = {Algorithmica}, volume = {46}, number = {3-4}, pages = {431--467}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0106-8}, doi = {10.1007/S00453-006-0106-8}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/LouchardP06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Maass06, author = {Moritz G. Maa{\ss}}, title = {Average-Case Analysis of Approximate Trie Search}, journal = {Algorithmica}, volume = {46}, number = {3-4}, pages = {469--491}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0126-4}, doi = {10.1007/S00453-006-0126-4}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Maass06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Oertzen06, author = {Timo von Oertzen}, title = {Exact Computation of Polynomial Zeros Expressible by Square Roots}, journal = {Algorithmica}, volume = {46}, number = {1}, pages = {119--136}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0071-2}, doi = {10.1007/S00453-006-0071-2}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Oertzen06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/OmarPRW06, author = {Mohamed Omar and Daniel Panario and L. Bruce Richmond and Jacki Whitely}, title = {Asymptotics of Largest Components in Combinatorial Structures}, journal = {Algorithmica}, volume = {46}, number = {3-4}, pages = {493--503}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0103-y}, doi = {10.1007/S00453-006-0103-Y}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/OmarPRW06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/PoulalhonS06, author = {Dominique Poulalhon and Gilles Schaeffer}, title = {Optimal Coding and Sampling of Triangulations}, journal = {Algorithmica}, volume = {46}, number = {3-4}, pages = {505--527}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0114-8}, doi = {10.1007/S00453-006-0114-8}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/PoulalhonS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Ravelomanana06, author = {Vlady Ravelomanana}, title = {The Average Size of Giant Components between the Double-Jump}, journal = {Algorithmica}, volume = {46}, number = {3-4}, pages = {529--555}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0108-6}, doi = {10.1007/S00453-006-0108-6}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Ravelomanana06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Seroussi06, author = {Gadiel Seroussi}, title = {On the Number of t-Ary Trees with a Given Path Length}, journal = {Algorithmica}, volume = {46}, number = {3-4}, pages = {557--565}, year = {2006}, url = {https://doi.org/10.1007/s00453-006-0122-8}, doi = {10.1007/S00453-006-0122-8}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Seroussi06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/Zwick06, author = {Uri Zwick}, title = {A Slightly Improved Sub-Cubic Algorithm for the All PairsShortest Paths Problem with Real Edge Lengths}, journal = {Algorithmica}, volume = {46}, number = {2}, pages = {181--192}, year = {2006}, url = {https://doi.org/10.1007/s00453-005-1199-1}, doi = {10.1007/S00453-005-1199-1}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Zwick06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.