default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jal/jal2.bht:"
download as .bib file
@article{DBLP:journals/jal/Allison81,
author = {Lloyd Allison},
title = {Generating Coset Representatives for Permutation Groups},
journal = {J. Algorithms},
volume = {2},
number = {3},
pages = {227--244},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90024-9},
doi = {10.1016/0196-6774(81)90024-9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Allison81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BakerBK81,
author = {Brenda S. Baker and
Donna J. Brown and
Howard P. Katseff},
title = {A 5/4 Algorithm for Two-Dimensional Packing},
journal = {J. Algorithms},
volume = {2},
number = {4},
pages = {348--368},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90034-1},
doi = {10.1016/0196-6774(81)90034-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BakerBK81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Bar-YehudaE81,
author = {Reuven Bar{-}Yehuda and
Shimon Even},
title = {A Linear-Time Approximation Algorithm for the Weighted Vertex Cover
Problem},
journal = {J. Algorithms},
volume = {2},
number = {2},
pages = {198--203},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90020-1},
doi = {10.1016/0196-6774(81)90020-1},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Bar-YehudaE81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Burge81,
author = {William H. Burge},
title = {Stacks in a Two-Level Store},
journal = {J. Algorithms},
volume = {2},
number = {2},
pages = {178--185},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90018-3},
doi = {10.1016/0196-6774(81)90018-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Burge81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Cantor81,
author = {David G. Cantor},
title = {Irreducible Polynomials with Integral Coefficients Have Succinct Certificates},
journal = {J. Algorithms},
volume = {2},
number = {4},
pages = {385--392},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90036-5},
doi = {10.1016/0196-6774(81)90036-5},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Cantor81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ChibaNS81,
author = {Norishige Chiba and
Takao Nishizeki and
Nobuji Saito},
title = {A Linear 5-Coloring Algorithm of Planar Graphs},
journal = {J. Algorithms},
volume = {2},
number = {4},
pages = {317--327},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90031-6},
doi = {10.1016/0196-6774(81)90031-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/ChibaNS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/EadesS81,
author = {Peter Eades and
John Staples},
title = {On Optimal Trees},
journal = {J. Algorithms},
volume = {2},
number = {4},
pages = {369--384},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90035-3},
doi = {10.1016/0196-6774(81)90035-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/EadesS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Ehrlich81,
author = {Gideon Ehrlich},
title = {Searching and Sorting Real Numbers},
journal = {J. Algorithms},
volume = {2},
number = {1},
pages = {1--12},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90002-X},
doi = {10.1016/0196-6774(81)90002-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Ehrlich81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ElGindyA81,
author = {Hossam A. ElGindy and
David Avis},
title = {A Linear Algorithm for Computing the Visibility Polygon from a Point},
journal = {J. Algorithms},
volume = {2},
number = {2},
pages = {186--197},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90019-5},
doi = {10.1016/0196-6774(81)90019-5},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/ElGindyA81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/EvenG81,
author = {Shimon Even and
Oded Goldreich},
title = {The Minimum-Length Generator Sequence Problem is NP-Hard},
journal = {J. Algorithms},
volume = {2},
number = {3},
pages = {311--313},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90029-8},
doi = {10.1016/0196-6774(81)90029-8},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/EvenG81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Feig81,
author = {Ephraim Feig},
title = {On Systems of Bilinear Forms Whose Minimal Division-Free Algorithms
Are All Bilinear},
journal = {J. Algorithms},
volume = {2},
number = {3},
pages = {261--281},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90026-2},
doi = {10.1016/0196-6774(81)90026-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Feig81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Frank81,
author = {Andr{\'{a}}s Frank},
title = {A Weighted Matroid Intersection Algorithm},
journal = {J. Algorithms},
volume = {2},
number = {4},
pages = {328--336},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90032-8},
doi = {10.1016/0196-6774(81)90032-8},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/Frank81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Fredman81,
author = {Michael L. Fredman},
title = {The Spanning Bound as a Measure of Range Query Complexity},
journal = {J. Algorithms},
volume = {2},
number = {1},
pages = {77--87},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90009-2},
doi = {10.1016/0196-6774(81)90009-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Fredman81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Guibas81,
author = {Leonidas J. Guibas},
title = {Problems},
journal = {J. Algorithms},
volume = {2},
number = {1},
pages = {103--104},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90011-0},
doi = {10.1016/0196-6774(81)90011-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Guibas81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Guibas81a,
author = {Leonidas J. Guibas},
title = {Problems},
journal = {J. Algorithms},
volume = {2},
number = {2},
pages = {208--210},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90022-5},
doi = {10.1016/0196-6774(81)90022-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Guibas81a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Guibas81b,
author = {Leonidas J. Guibas},
title = {Problems},
journal = {J. Algorithms},
volume = {2},
number = {3},
pages = {314--315},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90030-4},
doi = {10.1016/0196-6774(81)90030-4},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Guibas81b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HentzelH81,
author = {Irvin Roy Hentzel and
Leslie Hogben},
title = {Exhaustive Checking of Sparse Algebras},
journal = {J. Algorithms},
volume = {2},
number = {1},
pages = {44--49},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90006-7},
doi = {10.1016/0196-6774(81)90006-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/HentzelH81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HuS81,
author = {T. C. Hu and
M. T. Shing},
title = {An O(n) Algorithm to Find a Near-Optimum Partition of a Convex Polygon},
journal = {J. Algorithms},
volume = {2},
number = {2},
pages = {122--138},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90014-6},
doi = {10.1016/0196-6774(81)90014-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/HuS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Johnson81,
author = {David S. Johnson},
title = {The NP-Completeness Column: An Ongoing Guide},
journal = {J. Algorithms},
volume = {2},
number = {4},
pages = {393--405},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90037-7},
doi = {10.1016/0196-6774(81)90037-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Johnson81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Klarner81,
author = {David A. Klarner},
title = {An Algorithm to Determine When Certain Sets Have 0-Density},
journal = {J. Algorithms},
volume = {2},
number = {1},
pages = {31--43},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90005-5},
doi = {10.1016/0196-6774(81)90005-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Klarner81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/LeeW81,
author = {D. T. Lee and
C. K. Wong},
title = {Finding Intersection of Rectangles by Range Search},
journal = {J. Algorithms},
volume = {2},
number = {4},
pages = {337--347},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90033-X},
doi = {10.1016/0196-6774(81)90033-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/LeeW81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/LeeuwenW81,
author = {Jan van Leeuwen and
Derick Wood},
title = {The Measure Problem for Rectangular Ranges in d-Space},
journal = {J. Algorithms},
volume = {2},
number = {3},
pages = {282--300},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90027-4},
doi = {10.1016/0196-6774(81)90027-4},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/LeeuwenW81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/LipskiP81,
author = {Witold Lipski Jr. and
Franco P. Preparata},
title = {Segments, Rectangles, Contours},
journal = {J. Algorithms},
volume = {2},
number = {1},
pages = {63--76},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90008-0},
doi = {10.1016/0196-6774(81)90008-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/LipskiP81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/LipskiP81a,
author = {Witold Lipski Jr. and
Franco P. Preparata},
title = {Erratum: Finding the Contour of a Union of Iso-Oriented Rectangles},
journal = {J. Algorithms},
volume = {2},
number = {1},
pages = {105},
year = {1981},
timestamp = {Thu, 29 Nov 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/LipskiP81a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/LipskiP81b,
author = {Witold Lipski Jr. and
Christos H. Papadimitriou},
title = {A Fast Algorithm for Testing for Safety and Detecting Deadlocks in
Locked Transaction Systems},
journal = {J. Algorithms},
volume = {2},
number = {3},
pages = {211--226},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90023-7},
doi = {10.1016/0196-6774(81)90023-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/LipskiP81b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Melville81,
author = {Robert Melville},
title = {A Time/Space Tradeoff for In-Place Array Permutation},
journal = {J. Algorithms},
volume = {2},
number = {2},
pages = {139--143},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90015-8},
doi = {10.1016/0196-6774(81)90015-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Melville81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/MoranP81,
author = {Shlomo Moran and
Yehoshua Perl},
title = {The Complexity of Identifying Redundant and Essential Elements},
journal = {J. Algorithms},
volume = {2},
number = {1},
pages = {22--30},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90004-3},
doi = {10.1016/0196-6774(81)90004-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/MoranP81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Olivos81,
author = {Jorge Olivos},
title = {On Vectorial Addition Chains},
journal = {J. Algorithms},
volume = {2},
number = {1},
pages = {13--21},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90003-1},
doi = {10.1016/0196-6774(81)90003-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Olivos81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Overmars81,
author = {Mark H. Overmars},
title = {Dynamization of Order Decomposable Set Problems},
journal = {J. Algorithms},
volume = {2},
number = {3},
pages = {245--260},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90025-0},
doi = {10.1016/0196-6774(81)90025-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Overmars81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Pan81,
author = {Victor Y. Pan},
title = {The Bit-Complexity of Arithmetic Algorithms},
journal = {J. Algorithms},
volume = {2},
number = {2},
pages = {144--163},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90016-X},
doi = {10.1016/0196-6774(81)90016-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Pan81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Pan81a,
author = {Victor Y. Pan},
title = {A Unified Approach to the Analysis of Bilinear Algorithms},
journal = {J. Algorithms},
volume = {2},
number = {3},
pages = {301--310},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90028-6},
doi = {10.1016/0196-6774(81)90028-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Pan81a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Pearl81,
author = {Judea Pearl},
title = {A Space-Efficient On-Line Method of Computing Quantile Estimates},
journal = {J. Algorithms},
volume = {2},
number = {2},
pages = {164--177},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90017-1},
doi = {10.1016/0196-6774(81)90017-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Pearl81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Ralston81,
author = {Anthony Ralston},
title = {A New Memoryless Algorithm for De Bruijn Sequences},
journal = {J. Algorithms},
volume = {2},
number = {1},
pages = {50--62},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90007-9},
doi = {10.1016/0196-6774(81)90007-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Ralston81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Shiloach81,
author = {Yossi Shiloach},
title = {Fast Canonization of Circular Strings},
journal = {J. Algorithms},
volume = {2},
number = {2},
pages = {107--121},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90013-4},
doi = {10.1016/0196-6774(81)90013-4},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Shiloach81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ShiloachV81,
author = {Yossi Shiloach and
Uzi Vishkin},
title = {Finding the Maximum, Merging, and Sorting in a Parallel Computation
Model},
journal = {J. Algorithms},
volume = {2},
number = {1},
pages = {88--102},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90010-9},
doi = {10.1016/0196-6774(81)90010-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/ShiloachV81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Wilf81,
author = {Herbert S. Wilf},
title = {The Uniform Selection of Free Trees},
journal = {J. Algorithms},
volume = {2},
number = {2},
pages = {204--207},
year = {1981},
url = {https://doi.org/10.1016/0196-6774(81)90021-3},
doi = {10.1016/0196-6774(81)90021-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Wilf81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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-11-08 04:50 CET 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:
