default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jal/jal5.bht:"
download as .bib file
@article{DBLP:journals/jal/AnsteeF84,
author = {Richard P. Anstee and
Martin Farber},
title = {Characterizations of Totally Balanced Matrices},
journal = {J. Algorithms},
volume = {5},
number = {2},
pages = {215--230},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90028-2},
doi = {10.1016/0196-6774(84)90028-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AnsteeF84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/AssmannJKL84,
author = {Susan F. Assmann and
David S. Johnson and
Daniel J. Kleitman and
Joseph Y.{-}T. Leung},
title = {On a Dual Version of the One-Dimensional Bin Packing Problem},
journal = {J. Algorithms},
volume = {5},
number = {4},
pages = {502--525},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90004-X},
doi = {10.1016/0196-6774(84)90004-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/AssmannJKL84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BoshernitzanF84,
author = {M. Boshernitzan and
Aviezri S. Fraenkel},
title = {A Linear Algorithm for Nonhomogeneous Spectra of Numbers},
journal = {J. Algorithms},
volume = {5},
number = {2},
pages = {187--198},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90026-9},
doi = {10.1016/0196-6774(84)90026-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BoshernitzanF84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/CorneilG84,
author = {Derek G. Corneil and
Mark K. Goldberg},
title = {A Non-Factorial Algorithm for Canonical Numbering of a Graph},
journal = {J. Algorithms},
volume = {5},
number = {3},
pages = {345--362},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90015-4},
doi = {10.1016/0196-6774(84)90015-4},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/CorneilG84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/DolevW84,
author = {Danny Dolev and
Manfred K. Warmuth},
title = {Scheduling Precedence Graphs of Bounded Height},
journal = {J. Algorithms},
volume = {5},
number = {1},
pages = {48--59},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90039-7},
doi = {10.1016/0196-6774(84)90039-7},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/DolevW84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/GabowT84,
author = {Harold N. Gabow and
Robert Endre Tarjan},
title = {Efficient Algorithms for a Family of Matroid Intersection Problems},
journal = {J. Algorithms},
volume = {5},
number = {1},
pages = {80--131},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90042-7},
doi = {10.1016/0196-6774(84)90042-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/GabowT84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/GilbertHT84,
author = {John R. Gilbert and
Joan P. Hutchinson and
Robert Endre Tarjan},
title = {A Separator Theorem for Graphs of Bounded Genus},
journal = {J. Algorithms},
volume = {5},
number = {3},
pages = {391--407},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90019-1},
doi = {10.1016/0196-6774(84)90019-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/GilbertHT84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/GonnetM84,
author = {Gaston H. Gonnet and
J. Ian Munro},
title = {The Analysis of Linear Probing Sort by the Use of a New Mathematical
Transform},
journal = {J. Algorithms},
volume = {5},
number = {4},
pages = {451--470},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90001-4},
doi = {10.1016/0196-6774(84)90001-4},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/GonnetM84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Guibas84,
author = {Leonidas J. Guibas},
title = {Problems},
journal = {J. Algorithms},
volume = {5},
number = {1},
pages = {145--146},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90044-0},
doi = {10.1016/0196-6774(84)90044-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Guibas84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Guibas84a,
author = {Leonidas J. Guibas},
title = {Problems},
journal = {J. Algorithms},
volume = {5},
number = {4},
pages = {579--594},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90009-9},
doi = {10.1016/0196-6774(84)90009-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Guibas84a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/GurariS84,
author = {Eitan M. Gurari and
Ivan Hal Sudborough},
title = {Improved Dynamic Programming Algorithms for Bandwidth Minimization
and the MinCut Linear Arrangement Problem},
journal = {J. Algorithms},
volume = {5},
number = {4},
pages = {531--546},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90006-3},
doi = {10.1016/0196-6774(84)90006-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/GurariS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Gusfield84,
author = {Dan Gusfield},
title = {Bounds for Naive Multiple Machine Scheduling with Release Times and
Deadlines},
journal = {J. Algorithms},
volume = {5},
number = {1},
pages = {1--6},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90035-X},
doi = {10.1016/0196-6774(84)90035-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Gusfield84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Guting84,
author = {Ralf Hartmut G{\"{u}}ting},
title = {An Optimal Contour Algorithm for Iso-Oriented Rectangles},
journal = {J. Algorithms},
volume = {5},
number = {3},
pages = {303--326},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90013-0},
doi = {10.1016/0196-6774(84)90013-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Guting84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HakimiS84,
author = {S. Louis Hakimi and
Edward F. Schmeichel},
title = {An Adaptive Algorithm for System Level Diagnosis},
journal = {J. Algorithms},
volume = {5},
number = {4},
pages = {526--530},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90005-1},
doi = {10.1016/0196-6774(84)90005-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/HakimiS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Hofri84,
author = {Micha Hofri},
title = {A Probabilistic Analysis of the Next-Fit Bin Packing Algorithm},
journal = {J. Algorithms},
volume = {5},
number = {4},
pages = {547--556},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90007-5},
doi = {10.1016/0196-6774(84)90007-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Hofri84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/HuangW84,
author = {Shou{-}Hsuan Stephen Huang and
C. K. Wong},
title = {Optimal Binary Split Trees},
journal = {J. Algorithms},
volume = {5},
number = {1},
pages = {69--79},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90041-5},
doi = {10.1016/0196-6774(84)90041-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/HuangW84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Johnson84,
author = {David S. Johnson},
title = {The NP-Completeness Column: An Ongoing Guide},
journal = {J. Algorithms},
volume = {5},
number = {1},
pages = {147--160},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90045-2},
doi = {10.1016/0196-6774(84)90045-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Johnson84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Johnson84a,
author = {David S. Johnson},
title = {The NP-Completeness Column: An Ongoing Guide},
journal = {J. Algorithms},
volume = {5},
number = {2},
pages = {284--299},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90032-4},
doi = {10.1016/0196-6774(84)90032-4},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Johnson84a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Johnson84b,
author = {David S. Johnson},
title = {The NP-Completeness Column: An Ongoing Guide},
journal = {J. Algorithms},
volume = {5},
number = {3},
pages = {433--447},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90022-1},
doi = {10.1016/0196-6774(84)90022-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Johnson84b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Johnson84c,
author = {David S. Johnson},
title = {The NP-Completeness Column: An Ongoing Guide},
journal = {J. Algorithms},
volume = {5},
number = {4},
pages = {595--609},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90010-5},
doi = {10.1016/0196-6774(84)90010-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Johnson84c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Knott84,
author = {Gary D. Knott},
title = {Direct-Chaining with Coalescing Lists},
journal = {J. Algorithms},
volume = {5},
number = {1},
pages = {7--21},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90036-1},
doi = {10.1016/0196-6774(84)90036-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Knott84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Larson84,
author = {Per{-}{\AA}ke Larson},
title = {Analysis of Hashing with Chaining in the Prime Area},
journal = {J. Algorithms},
volume = {5},
number = {1},
pages = {36--47},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90038-5},
doi = {10.1016/0196-6774(84)90038-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Larson84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Lengauer84,
author = {Thomas Lengauer},
title = {On the Solution of Inequality Systems Relevant to IC-Layout},
journal = {J. Algorithms},
volume = {5},
number = {3},
pages = {408--421},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90020-8},
doi = {10.1016/0196-6774(84)90020-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Lengauer84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Leung84,
author = {Joseph Y.{-}T. Leung},
title = {Fast Algorithms for Generating All Maximal Independent Sets of Interval,
Circular-Arc and Chordal Graphs},
journal = {J. Algorithms},
volume = {5},
number = {1},
pages = {22--35},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90037-3},
doi = {10.1016/0196-6774(84)90037-3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Leung84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/MainL84,
author = {Michael G. Main and
Richard J. Lorentz},
title = {An O(n log n) Algorithm for Finding All Repetitions in a String},
journal = {J. Algorithms},
volume = {5},
number = {3},
pages = {422--432},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90021-X},
doi = {10.1016/0196-6774(84)90021-X},
timestamp = {Mon, 29 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/MainL84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/PapadimitriouV84,
author = {Christos H. Papadimitriou and
Umesh V. Vazirani},
title = {On Two Geometric Problems Related to the Traveling Salesman Problem},
journal = {J. Algorithms},
volume = {5},
number = {2},
pages = {231--246},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90029-4},
doi = {10.1016/0196-6774(84)90029-4},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/PapadimitriouV84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Perl84,
author = {Yehoshua Perl},
title = {Optimum Split Trees},
journal = {J. Algorithms},
volume = {5},
number = {3},
pages = {367--374},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90017-8},
doi = {10.1016/0196-6774(84)90017-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Perl84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Plaisted84,
author = {David A. Plaisted},
title = {Heuristic Matching for Graphs Satisfying the Triangle Inequality},
journal = {J. Algorithms},
volume = {5},
number = {2},
pages = {163--179},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90024-5},
doi = {10.1016/0196-6774(84)90024-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Plaisted84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/RamananDL84,
author = {Prakash V. Ramanan and
Jitender S. Deogun and
C. L. Liu},
title = {A Personnel Assignment Problem},
journal = {J. Algorithms},
volume = {5},
number = {1},
pages = {132--144},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90043-9},
doi = {10.1016/0196-6774(84)90043-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/RamananDL84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/RamananH84,
author = {Prakash V. Ramanan and
Laurent Hyafil},
title = {New Algorithms for Selection},
journal = {J. Algorithms},
volume = {5},
number = {4},
pages = {557--578},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90008-7},
doi = {10.1016/0196-6774(84)90008-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/RamananH84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/RemmelW84,
author = {Jeffrey B. Remmel and
Roger Whitney},
title = {Multiplying Schur functions},
journal = {J. Algorithms},
volume = {5},
number = {4},
pages = {471--487},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90002-6},
doi = {10.1016/0196-6774(84)90002-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/RemmelW84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/RosentiehlT84,
author = {Pierre Rosenstiehl and
Robert Endre Tarjan},
title = {Gauss Codes, Planar Hamiltonian Graphs, and Stack-Sortable Permutations},
journal = {J. Algorithms},
volume = {5},
number = {3},
pages = {375--390},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90018-X},
doi = {10.1016/0196-6774(84)90018-X},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/RosentiehlT84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Semba84,
author = {Ichiro Semba},
title = {An Efficient Algorithm for Generating All k-Subsets {(1} {\textless}=
k {\textless}= m {\textless}= n) of the Set \{ 1, 2, ..., n \} in
Lexicographical Order},
journal = {J. Algorithms},
volume = {5},
number = {2},
pages = {281--283},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90031-2},
doi = {10.1016/0196-6774(84)90031-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Semba84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/SeroussiL84,
author = {Gadiel Seroussi and
Abraham Lempel},
title = {On Symmetric Algorithms for Bilinear Forms over Finite Fields},
journal = {J. Algorithms},
volume = {5},
number = {3},
pages = {327--344},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90014-2},
doi = {10.1016/0196-6774(84)90014-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/SeroussiL84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ShamirU84,
author = {Eli Shamir and
Eli Upfal},
title = {Sequential and Distributed Graph Coloring Algorithms with Performance
Analysis in Random Graph Spaces},
journal = {J. Algorithms},
volume = {5},
number = {4},
pages = {488--501},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90003-8},
doi = {10.1016/0196-6774(84)90003-8},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/ShamirU84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Soisalon-SoininenW84,
author = {Eljas Soisalon{-}Soininen and
Derick Wood},
title = {Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles},
journal = {J. Algorithms},
volume = {5},
number = {2},
pages = {199--214},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90027-0},
doi = {10.1016/0196-6774(84)90027-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Soisalon-SoininenW84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/TuckerW84,
author = {Alan C. Tucker and
Donna Wilson},
title = {An O(N{\({^2}\)}) Algorithm for Coloring Perfect Planar Graphs},
journal = {J. Algorithms},
volume = {5},
number = {1},
pages = {60--68},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90040-3},
doi = {10.1016/0196-6774(84)90040-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/TuckerW84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Valiant84,
author = {Leslie G. Valiant},
title = {Short Monotone Formulae for the Majority Function},
journal = {J. Algorithms},
volume = {5},
number = {3},
pages = {363--366},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90016-6},
doi = {10.1016/0196-6774(84)90016-6},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/Valiant84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Weinberger84,
author = {Peter J. Weinberger},
title = {Finding the Number of Factors of a Polynomial},
journal = {J. Algorithms},
volume = {5},
number = {2},
pages = {180--186},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90025-7},
doi = {10.1016/0196-6774(84)90025-7},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Weinberger84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Wormald84,
author = {Nicholas C. Wormald},
title = {Generating Random Regular Graphs},
journal = {J. Algorithms},
volume = {5},
number = {2},
pages = {247--280},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90030-0},
doi = {10.1016/0196-6774(84)90030-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Wormald84.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-09-20 17:07 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:
