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/jal11.bht:"
download as .bib file
@article{DBLP:journals/jal/AdharP90,
author = {Gur Saran Adhar and
Shietung Peng},
title = {Parallel Algorithms for Cographs and Parity Graphs with Applications},
journal = {J. Algorithms},
volume = {11},
number = {2},
pages = {252--284},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90006-Z},
doi = {10.1016/0196-6774(90)90006-Z},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AdharP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AspnesH90,
author = {James Aspnes and
Maurice Herlihy},
title = {Fast Randomized Consensus Using Shared Memory},
journal = {J. Algorithms},
volume = {11},
number = {3},
pages = {441--461},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90021-6},
doi = {10.1016/0196-6774(90)90021-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AspnesH90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Awerbuch90,
author = {Baruch Awerbuch},
title = {On the Effects of Feedback in Dynamic Network Protocols},
journal = {J. Algorithms},
volume = {11},
number = {3},
pages = {342--373},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90018-A},
doi = {10.1016/0196-6774(90)90018-A},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Awerbuch90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AwerbuchBLP90,
author = {Baruch Awerbuch and
Amotz Bar{-}Noy and
Nathan Linial and
David Peleg},
title = {Improved Routing Strategies with Succinct Tables},
journal = {J. Algorithms},
volume = {11},
number = {3},
pages = {307--341},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90017-9},
doi = {10.1016/0196-6774(90)90017-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AwerbuchBLP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BermanJLSS90,
author = {Francine Berman and
David S. Johnson and
Frank Thomson Leighton and
Peter W. Shor and
Larry Snyder},
title = {Generalized Planar Matching},
journal = {J. Algorithms},
volume = {11},
number = {2},
pages = {153--184},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90001-U},
doi = {10.1016/0196-6774(90)90001-U},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BermanJLSS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BiranMZ90,
author = {Ofer Biran and
Shlomo Moran and
Shmuel Zaks},
title = {A Combinatorial Characterization of the Distributed 1-Solvable Tasks},
journal = {J. Algorithms},
volume = {11},
number = {3},
pages = {420--440},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90020-F},
doi = {10.1016/0196-6774(90)90020-F},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BiranMZ90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Bodlaender90,
author = {Hans L. Bodlaender},
title = {Polynomial Algorithms for Graph Isomorphism and Chromatic Index on
Partial k-Trees},
journal = {J. Algorithms},
volume = {11},
number = {4},
pages = {631--643},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90013-5},
doi = {10.1016/0196-6774(90)90013-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Bodlaender90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ChrobakN90,
author = {Marek Chrobak and
Takao Nishizeki},
title = {Improved Edge-Coloring Algorithms for Planar Graphs},
journal = {J. Algorithms},
volume = {11},
number = {1},
pages = {102--116},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90032-A},
doi = {10.1016/0196-6774(90)90032-A},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/ChrobakN90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Eppstein90,
author = {David Eppstein},
title = {Sequence Comparison with Mixed Convex and Concave Costs},
journal = {J. Algorithms},
volume = {11},
number = {1},
pages = {85--101},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90031-9},
doi = {10.1016/0196-6774(90)90031-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Eppstein90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/EverettC90,
author = {Hazel Everett and
Derek G. Corneil},
title = {Recognizing Visibility Graphs of Spiral Polygons},
journal = {J. Algorithms},
volume = {11},
number = {1},
pages = {1--26},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90026-B},
doi = {10.1016/0196-6774(90)90026-B},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/EverettC90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Hastad90,
author = {Johan H{\aa}stad},
title = {Tensor Rank is NP-Complete},
journal = {J. Algorithms},
volume = {11},
number = {4},
pages = {644--654},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90014-6},
doi = {10.1016/0196-6774(90)90014-6},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/Hastad90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Huang90,
author = {Yuejiang Huang},
title = {A New Algorithm for the Generation of Binary de Bruijn Sequences},
journal = {J. Algorithms},
volume = {11},
number = {1},
pages = {44--51},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90028-D},
doi = {10.1016/0196-6774(90)90028-D},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Huang90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HuangT90,
author = {Ming{-}Deh A. Huang and
Shang{-}Hua Teng},
title = {Security, Verifiability, and Universality in Distributed Computing},
journal = {J. Algorithms},
volume = {11},
number = {3},
pages = {492--521},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90023-8},
doi = {10.1016/0196-6774(90)90023-8},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/HuangT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Johnson90,
author = {David S. Johnson},
title = {The NP-Completeness Column: An Ongoing Guide},
journal = {J. Algorithms},
volume = {11},
number = {1},
pages = {144--151},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90035-D},
doi = {10.1016/0196-6774(90)90035-D},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Johnson90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/JohnsonZ90,
author = {David B. Johnson and
Willy Zwaenepoel},
title = {Recovery in Distributed Systems Using Optimistic Message Logging and
Checkpointing},
journal = {J. Algorithms},
volume = {11},
number = {3},
pages = {462--491},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90022-7},
doi = {10.1016/0196-6774(90)90022-7},
timestamp = {Mon, 01 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/JohnsonZ90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Kantor90,
author = {William M. Kantor},
title = {Finding Sylow Normalizers in Polynomial Time},
journal = {J. Algorithms},
volume = {11},
number = {4},
pages = {523--563},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90009-4},
doi = {10.1016/0196-6774(90)90009-4},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/Kantor90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Kulkarni90,
author = {Vidyadhar G. Kulkarni},
title = {Generating Random Combinatorial Objects},
journal = {J. Algorithms},
volume = {11},
number = {2},
pages = {185--207},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90002-V},
doi = {10.1016/0196-6774(90)90002-V},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Kulkarni90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/LiM90,
author = {Liwu Li and
T. Anthony Marsland},
title = {Probability-Based Game Tree Pruning},
journal = {J. Algorithms},
volume = {11},
number = {1},
pages = {27--43},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90027-C},
doi = {10.1016/0196-6774(90)90027-C},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/LiM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ManasseMS90,
author = {Mark S. Manasse and
Lyle A. McGeoch and
Daniel Dominic Sleator},
title = {Competitive Algorithms for Server Problems},
journal = {J. Algorithms},
volume = {11},
number = {2},
pages = {208--230},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90003-W},
doi = {10.1016/0196-6774(90)90003-W},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/ManasseMS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/MansourS90,
author = {Yishay Mansour and
Leonard J. Schulman},
title = {Sorting on a Ring of Processors},
journal = {J. Algorithms},
volume = {11},
number = {4},
pages = {622--630},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90012-4},
doi = {10.1016/0196-6774(90)90012-4},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/MansourS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/McKayW90,
author = {Brendan D. McKay and
Nicholas C. Wormald},
title = {Uniform Generation of Random Regular Graphs of Moderate Degree},
journal = {J. Algorithms},
volume = {11},
number = {1},
pages = {52--67},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90029-E},
doi = {10.1016/0196-6774(90)90029-E},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/McKayW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/MortonS90,
author = {H. R. Morton and
H. B. Short},
title = {Calculating the 2-Variable Polynomial for Knots Presented as Closed
Braids},
journal = {J. Algorithms},
volume = {11},
number = {1},
pages = {117--131},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90033-B},
doi = {10.1016/0196-6774(90)90033-B},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/MortonS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/MountS90,
author = {David M. Mount and
Ruth Silverman},
title = {Packing and Covering the Plane with Translates of a Convex Polygon},
journal = {J. Algorithms},
volume = {11},
number = {4},
pages = {564--580},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90010-C},
doi = {10.1016/0196-6774(90)90010-C},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/MountS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/NaorN90,
author = {Joseph Naor and
Mark B. Novick},
title = {An Efficient Reconstruction of a Graph from its Line Graph in Parallel},
journal = {J. Algorithms},
volume = {11},
number = {1},
pages = {132--143},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90034-C},
doi = {10.1016/0196-6774(90)90034-C},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/NaorN90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/NeigerT90,
author = {Gil Neiger and
Sam Toueg},
title = {Automatically Increasing the Fault-Tolerance of Distributed Algorithms},
journal = {J. Algorithms},
volume = {11},
number = {3},
pages = {374--419},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90019-B},
doi = {10.1016/0196-6774(90)90019-B},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/NeigerT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Ronn90,
author = {Eytan Ronn},
title = {NP-Complete Stable Matching Problems},
journal = {J. Algorithms},
volume = {11},
number = {2},
pages = {285--304},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90007-2},
doi = {10.1016/0196-6774(90)90007-2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Ronn90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/RuskeyP90,
author = {Frank Ruskey and
Andrzej Proskurowski},
title = {Generating Binary Trees by Transpositions},
journal = {J. Algorithms},
volume = {11},
number = {1},
pages = {68--84},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90030-I},
doi = {10.1016/0196-6774(90)90030-I},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/RuskeyP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/SchmeichelHOS90,
author = {Edward F. Schmeichel and
S. Louis Hakimi and
M. Otsuka and
Geoff Sullivan},
title = {A Parallel Fault Identification Algorithm},
journal = {J. Algorithms},
volume = {11},
number = {2},
pages = {231--241},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90004-X},
doi = {10.1016/0196-6774(90)90004-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/SchmeichelHOS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ShashaZ90,
author = {Dennis E. Shasha and
Kaizhong Zhang},
title = {Fast Algorithms for the Unit Cost Editing Distance Between Trees},
journal = {J. Algorithms},
volume = {11},
number = {4},
pages = {581--621},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90011-3},
doi = {10.1016/0196-6774(90)90011-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/ShashaZ90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/WeissS90,
author = {Mark Allen Weiss and
Robert Sedgewick},
title = {Tight Lower Bounds for Shellsort},
journal = {J. Algorithms},
volume = {11},
number = {2},
pages = {242--251},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90005-Y},
doi = {10.1016/0196-6774(90)90005-Y},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/WeissS90.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-30 15:57 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:
