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/jal/jal25.bht:"
download as .bib file
@article{DBLP:journals/jal/AfekS97,
author = {Yehuda Afek and
Gideon Stupp},
title = {Optimal Time-Space Tradeoff for Shared Memory Leader Election},
journal = {J. Algorithms},
volume = {25},
number = {1},
pages = {95--117},
year = {1997},
url = {https://doi.org/10.1006/jagm.1996.0852},
doi = {10.1006/JAGM.1996.0852},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AfekS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AlonK97,
author = {Noga Alon and
Dmitry N. Kozlov},
title = {Coins with Arbitrary Weights},
journal = {J. Algorithms},
volume = {25},
number = {1},
pages = {162--176},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0871},
doi = {10.1006/JAGM.1997.0871},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AlonK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AzarE97,
author = {Yossi Azar and
Leah Epstein},
title = {On Two Dimensional Packing},
journal = {J. Algorithms},
volume = {25},
number = {2},
pages = {290--310},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0876},
doi = {10.1006/JAGM.1997.0876},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AzarE97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BarbeauKS97,
author = {Michel Barbeau and
Froduald Kabanza and
Richard St{-}Denis},
title = {An Efficient Algorithm for Controller Synthesis under Full Observation},
journal = {J. Algorithms},
volume = {25},
number = {1},
pages = {144--161},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0877},
doi = {10.1006/JAGM.1997.0877},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BarbeauKS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BekesiGPW97,
author = {J{\'{o}}zsef B{\'{e}}k{\'{e}}si and
G{\'{a}}bor Galambos and
Ulrich Pferschy and
Gerhard J. Woeginger},
title = {Greedy Algorithms for On-Line Data Compression},
journal = {J. Algorithms},
volume = {25},
number = {2},
pages = {274--289},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0885},
doi = {10.1006/JAGM.1997.0885},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BekesiGPW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BergerS97,
author = {Bonnie Berger and
Peter W. Shor},
title = {Tight Bounds for the Maximum Acyclic Subgraph Problem},
journal = {J. Algorithms},
volume = {25},
number = {1},
pages = {1--18},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0864},
doi = {10.1006/JAGM.1997.0864},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/BergerS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BhattacharyaK97,
author = {Binay K. Bhattacharya and
Damon Kaller},
title = {An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc
Graphs},
journal = {J. Algorithms},
volume = {25},
number = {2},
pages = {336--358},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0868},
doi = {10.1006/JAGM.1997.0868},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BhattacharyaK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BhattacharyaS97,
author = {Binay K. Bhattacharya and
Sandeep Sen},
title = {On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar
Convex Hull Algorithm},
journal = {J. Algorithms},
volume = {25},
number = {1},
pages = {177--193},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0869},
doi = {10.1006/JAGM.1997.0869},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BhattacharyaS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/DietzfelbingerHKP97,
author = {Martin Dietzfelbinger and
Torben Hagerup and
Jyrki Katajainen and
Martti Penttonen},
title = {A Reliable Randomized Algorithm for the Closest-Pair Problem},
journal = {J. Algorithms},
volume = {25},
number = {1},
pages = {19--51},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0873},
doi = {10.1006/JAGM.1997.0873},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/DietzfelbingerHKP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HabibNS97,
author = {Michel Habib and
Lhouari Nourine and
George Steiner},
title = {Gray Codes for the Ideals of Interval Orders},
journal = {J. Algorithms},
volume = {25},
number = {1},
pages = {52--66},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0863},
doi = {10.1006/JAGM.1997.0863},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/HabibNS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Hare97,
author = {D. E. G. Hare},
title = {Computing the Principal Branch of log-Gamma},
journal = {J. Algorithms},
volume = {25},
number = {2},
pages = {221--236},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0881},
doi = {10.1006/JAGM.1997.0881},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Hare97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HeydariS97,
author = {Mohammad Hossain Heydari and
Ivan Hal Sudborough},
title = {On the Diameter of the Pancake Network},
journal = {J. Algorithms},
volume = {25},
number = {1},
pages = {67--94},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0874},
doi = {10.1006/JAGM.1997.0874},
timestamp = {Tue, 26 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/HeydariS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KleinS97,
author = {Philip N. Klein and
Sairam Subramanian},
title = {A Randomized Parallel Algorithm for Single-Source Shortest Paths},
journal = {J. Algorithms},
volume = {25},
number = {2},
pages = {205--220},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0888},
doi = {10.1006/JAGM.1997.0888},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KleinS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/KorshL97,
author = {James F. Korsh and
Seymour Lipschutz},
title = {Generating Multiset Permutations in Constant Time},
journal = {J. Algorithms},
volume = {25},
number = {2},
pages = {321--335},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0889},
doi = {10.1006/JAGM.1997.0889},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/KorshL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Krivelevich97,
author = {Michael Krivelevich},
title = {Approximate Set Covering in Uniform Hypergraphs},
journal = {J. Algorithms},
volume = {25},
number = {1},
pages = {118--143},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0872},
doi = {10.1006/JAGM.1997.0872},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Krivelevich97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/LuczakS97,
author = {Tomasz Luczak and
Edyta Szymanska},
title = {A Parallel Randomized Algorithm for Finding a Maximal Independent
Set in a Linear Hypergraph},
journal = {J. Algorithms},
volume = {25},
number = {2},
pages = {311--320},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0884},
doi = {10.1006/JAGM.1997.0884},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/LuczakS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Slavik97,
author = {Peter Slav{\'{\i}}k},
title = {A Tight Analysis of the Greedy Algorithm for Set Cover},
journal = {J. Algorithms},
volume = {25},
number = {2},
pages = {237--254},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0887},
doi = {10.1006/JAGM.1997.0887},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Slavik97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/WangG97,
author = {Lusheng Wang and
Dan Gusfield},
title = {Improved Approximation Algorithms for Tree Alignment},
journal = {J. Algorithms},
volume = {25},
number = {2},
pages = {255--273},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0882},
doi = {10.1006/JAGM.1997.0882},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/WangG97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/YaoY97,
author = {Andrew Chi{-}Chih Yao and
Frances F. Yao},
title = {Dictionary Look-Up with One Error},
journal = {J. Algorithms},
volume = {25},
number = {1},
pages = {194--202},
year = {1997},
url = {https://doi.org/10.1006/jagm.1997.0875},
doi = {10.1006/JAGM.1997.0875},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/YaoY97.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-05-31 08:18 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:
