default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "stream:streams/journals/bit:"
download as .bib file
@article{DBLP:journals/bit/AtkinsonT93,
author = {M. D. Atkinson and
Murali Thiyagarajah},
title = {The Permutational Power of a Priority Queue},
journal = {{BIT}},
volume = {33},
number = {1},
pages = {1--6},
year = {1993},
url = {https://doi.org/10.1007/BF01990338},
doi = {10.1007/BF01990338},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/AtkinsonT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/BhagavathiLOSZ93,
author = {Dharmavani Bhagavathi and
Peter J. Looges and
Stephan Olariu and
James L. Schwing and
Jingyuan Zhang},
title = {Selection on Rectangular Meshes with Multiple Broadcasting},
journal = {{BIT}},
volume = {33},
number = {1},
pages = {7--14},
year = {1993},
url = {https://doi.org/10.1007/BF01990339},
doi = {10.1007/BF01990339},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/BhagavathiLOSZ93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/CesariniS93,
author = {Francesca Cesarini and
Giovanni Soda},
title = {Single Access Hashing with Overflow Separators for Dynamic Files},
journal = {{BIT}},
volume = {33},
number = {1},
pages = {15--28},
year = {1993},
url = {https://doi.org/10.1007/BF01990340},
doi = {10.1007/BF01990340},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/CesariniS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ChangKW93,
author = {Chin{-}Chen Chang and
Huey{-}Cheue Kowng and
Tzong{-}Chen Wu},
title = {A Refinement of a Compression-Oriented Addressing Scheme},
journal = {{BIT}},
volume = {33},
number = {4},
pages = {529--535},
year = {1993},
url = {https://doi.org/10.1007/BF01990533},
doi = {10.1007/BF01990533},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ChangKW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ChenWC93,
author = {Jong{-}Jeng Chen and
Chiau{-}Shin Wang and
Ching{-}Roung Chou},
title = {A General Performance Analysis Method for Uniform Memory Architectures},
journal = {{BIT}},
volume = {33},
number = {4},
pages = {536--560},
year = {1993},
url = {https://doi.org/10.1007/BF01990534},
doi = {10.1007/BF01990534},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ChenWC93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ChouC93,
author = {Hong Chich Chou and
Chung{-}Ping Chung},
title = {Modeling of Superscalar Instruction Scheduling and Analysis of a Heuristic
Scheduling Algorithm},
journal = {{BIT}},
volume = {33},
number = {3},
pages = {354--371},
year = {1993},
url = {https://doi.org/10.1007/BF01990519},
doi = {10.1007/BF01990519},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ChouC93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Dutton93,
author = {Ronald D. Dutton},
title = {Weak-Heap Sort},
journal = {{BIT}},
volume = {33},
number = {3},
pages = {372--381},
year = {1993},
url = {https://doi.org/10.1007/BF01990520},
doi = {10.1007/BF01990520},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Dutton93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/GambosiPT93,
author = {Giorgio Gambosi and
Marco Protasi and
Maurizio Talamo},
title = {An Efficient Implicit Data Structure for Relation Testing and Searching
in Partially Ordered Sets},
journal = {{BIT}},
volume = {33},
number = {1},
pages = {29--45},
year = {1993},
url = {https://doi.org/10.1007/BF01990341},
doi = {10.1007/BF01990341},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/GambosiPT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/HarrisR93,
author = {Evan P. Harris and
Kotagiri Ramamohanarao},
title = {Optimal Dynamic Multi-Attribute Hashing for Range Queries},
journal = {{BIT}},
volume = {33},
number = {4},
pages = {561--579},
year = {1993},
url = {https://doi.org/10.1007/BF01990535},
doi = {10.1007/BF01990535},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/HarrisR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ImielinskaK93,
author = {Celina Imielinska and
Bahman Kalantari},
title = {A Generalized Hypergreedy Algorithm for Weighted Perfect Matching},
journal = {{BIT}},
volume = {33},
number = {2},
pages = {177--189},
year = {1993},
url = {https://doi.org/10.1007/BF01989743},
doi = {10.1007/BF01989743},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ImielinskaK93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/JanC93,
author = {Jinn{-}Ke Jan and
Chin{-}Chen Chang},
title = {A Key-Lock-Pair Oriented Access Control Scheme for the Growth of Users
and Files},
journal = {{BIT}},
volume = {33},
number = {3},
pages = {382--389},
year = {1993},
url = {https://doi.org/10.1007/BF01990521},
doi = {10.1007/BF01990521},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/JanC93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/JansenW93,
author = {Klaus Jansen and
Gerhard J. Woeginger},
title = {The Complexity of Detecting Crossingfree Configurations in the Plane},
journal = {{BIT}},
volume = {33},
number = {4},
pages = {580--595},
year = {1993},
url = {https://doi.org/10.1007/BF01990536},
doi = {10.1007/BF01990536},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/JansenW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Liang93,
author = {Chiou{-}Kuo Liang},
title = {An \emph{O(n}\({}^{\mbox{2}}\)) Algorithm for Finding the Compact
Sets of a Graph},
journal = {{BIT}},
volume = {33},
number = {3},
pages = {390--395},
year = {1993},
url = {https://doi.org/10.1007/BF01990522},
doi = {10.1007/BF01990522},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Liang93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/LiawL93,
author = {Horng{-}Twu Liaw and
Chin{-}Laung Lei},
title = {An Optimal Algorithm to Assign Cryptographic Keys in a Tree Structure
for Access Control},
journal = {{BIT}},
volume = {33},
number = {1},
pages = {46--56},
year = {1993},
url = {https://doi.org/10.1007/BF01990342},
doi = {10.1007/BF01990342},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/LiawL93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Lundberg93,
author = {Lars Lundberg},
title = {Performance Bounds on Multiprocessor Scheduling Strategies for Statically
Allocated Programs},
journal = {{BIT}},
volume = {33},
number = {2},
pages = {190--213},
year = {1993},
url = {https://doi.org/10.1007/BF01989744},
doi = {10.1007/BF01989744},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Lundberg93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Lysne93,
author = {Olav Lysne},
title = {The Equational Part of Proofs by Structural Induction},
journal = {{BIT}},
volume = {33},
number = {4},
pages = {596--618},
year = {1993},
url = {https://doi.org/10.1007/BF01990537},
doi = {10.1007/BF01990537},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Lysne93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/OlariuSZ93,
author = {Stephan Olariu and
James L. Schwing and
Jingyuan Zhang},
title = {Optimal Convex Hull Algorithms on Enhanced Meshes},
journal = {{BIT}},
volume = {33},
number = {3},
pages = {396--410},
year = {1993},
url = {https://doi.org/10.1007/BF01990523},
doi = {10.1007/BF01990523},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/OlariuSZ93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Olsson93,
author = {Roland Olsson},
title = {Execution of Logic Programs by Iterative Deepening A* SLD-Tree Search},
journal = {{BIT}},
volume = {33},
number = {2},
pages = {214--231},
year = {1993},
url = {https://doi.org/10.1007/BF01989745},
doi = {10.1007/BF01989745},
timestamp = {Thu, 04 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Olsson93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Poblete93,
author = {Patricio V. Poblete},
title = {A Note on the Height of The \emph{k}the Element in a Heap},
journal = {{BIT}},
volume = {33},
number = {3},
pages = {411--412},
year = {1993},
url = {https://doi.org/10.1007/BF01990524},
doi = {10.1007/BF01990524},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Poblete93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Stewart93,
author = {Iain A. Stewart},
title = {An Parallelizing a Greedy Heuristic for Finding Small Dominant Sets},
journal = {{BIT}},
volume = {33},
number = {1},
pages = {57--62},
year = {1993},
url = {https://doi.org/10.1007/BF01990343},
doi = {10.1007/BF01990343},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Stewart93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/SykoraV93,
author = {Ondrej S{\'{y}}kora and
Imrich Vrto},
title = {On Crossing Numbers of Hypercubes and Cube Connected Cycles},
journal = {{BIT}},
volume = {33},
number = {2},
pages = {232--237},
year = {1993},
url = {https://doi.org/10.1007/BF01989746},
doi = {10.1007/BF01989746},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/SykoraV93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Wang93,
author = {Cao An Wang},
title = {Efficiently Updating Constrained Delaunay Triangulations},
journal = {{BIT}},
volume = {33},
number = {2},
pages = {238--252},
year = {1993},
url = {https://doi.org/10.1007/BF01989747},
doi = {10.1007/BF01989747},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Wang93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/YuC93,
author = {Chang{-}Wu Yu and
Gen{-}Huey Chen},
title = {Parallel Algorithms for Permutation Graphs},
journal = {{BIT}},
volume = {33},
number = {3},
pages = {413--419},
year = {1993},
url = {https://doi.org/10.1007/BF01990525},
doi = {10.1007/BF01990525},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/YuC93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/YuY93,
author = {Ming{-}Shing Yu and
Cheng{-}Hsing Yang},
title = {A Linear Time Algorithm for the Maximum Matching Problem on Cographs},
journal = {{BIT}},
volume = {33},
number = {3},
pages = {420--432},
year = {1993},
url = {https://doi.org/10.1007/BF01990526},
doi = {10.1007/BF01990526},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/YuY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ArnborgP92,
author = {Stefan Arnborg and
Andrzej Proskurowski},
title = {Canonical Representations of Partial 2- and 3-Trees},
journal = {{BIT}},
volume = {32},
number = {2},
pages = {197--214},
year = {1992},
url = {https://doi.org/10.1007/BF01994877},
doi = {10.1007/BF01994877},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ArnborgP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Baeza-YatesGZ92,
author = {Ricardo A. Baeza{-}Yates and
Gaston H. Gonnet and
Nivio Ziviani},
title = {Improved Bounds for the Expected Behaviour of {AVL} Trees},
journal = {{BIT}},
volume = {32},
number = {2},
pages = {297--315},
year = {1992},
url = {https://doi.org/10.1007/BF01994883},
doi = {10.1007/BF01994883},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Baeza-YatesGZ92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/BliebergerS92,
author = {Johann Blieberger and
Ulrich Schmid},
title = {FCFS-Scheduling in a Hard Real-Time Environment Under Rush-Hour Conditions},
journal = {{BIT}},
volume = {32},
number = {3},
pages = {370--383},
year = {1992},
url = {https://doi.org/10.1007/BF02074875},
doi = {10.1007/BF02074875},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/BliebergerS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/BoppanaH92,
author = {Ravi B. Boppana and
Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Approximating Maximum Independent Sets by Excluding Subgraphs},
journal = {{BIT}},
volume = {32},
number = {2},
pages = {180--196},
year = {1992},
url = {https://doi.org/10.1007/BF01994876},
doi = {10.1007/BF01994876},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/BoppanaH92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ChenYL92,
author = {Tung{-}Shou Chen and
Wei{-}Pang Yang and
Richard C. T. Lee},
title = {Amortized Analysis of Some Disk Scheduling Algorithms: SSTF, SCAN,
and \emph{N}-Step {SCAN}},
journal = {{BIT}},
volume = {32},
number = {4},
pages = {546--558},
year = {1992},
url = {https://doi.org/10.1007/BF01994839},
doi = {10.1007/BF01994839},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ChenYL92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Colson92,
author = {Lo{\"{\i}}c Colson},
title = {On List Primitive Recursion and the Complexity of Computing \emph{inf}},
journal = {{BIT}},
volume = {32},
number = {1},
pages = {5--9},
year = {1992},
url = {https://doi.org/10.1007/BF01995103},
doi = {10.1007/BF01995103},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Colson92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/CoolsaetMF92,
author = {Kris Coolsaet and
Hans E. De Meyer and
Veerle Fack},
title = {Optimal Algorithms for Total Exchange without Buffering on the Hypercube},
journal = {{BIT}},
volume = {32},
number = {4},
pages = {559--569},
year = {1992},
url = {https://doi.org/10.1007/BF01994840},
doi = {10.1007/BF01994840},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/CoolsaetMF92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Coquand92,
author = {Thierry Coquand},
title = {The Paradox of Trees in Type Theory},
journal = {{BIT}},
volume = {32},
number = {1},
pages = {10--14},
year = {1992},
url = {https://doi.org/10.1007/BF01995104},
doi = {10.1007/BF01995104},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Coquand92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Despeyroux92,
author = {Jo{\"{e}}lle Despeyroux},
title = {Theo: An Interactive Proof Development System},
journal = {{BIT}},
volume = {32},
number = {1},
pages = {15--29},
year = {1992},
url = {https://doi.org/10.1007/BF01995105},
doi = {10.1007/BF01995105},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Despeyroux92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Eppstein92,
author = {David Eppstein},
title = {Finding the \emph{k} Smallest Spanning Trees},
journal = {{BIT}},
volume = {32},
number = {2},
pages = {237--248},
year = {1992},
url = {https://doi.org/10.1007/BF01994879},
doi = {10.1007/BF01994879},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Eppstein92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/FredholmS92,
author = {Daniel Fredholm and
Svetozar Serafimovski},
title = {Partial Inductive Definitions as Type-Systems for lambda-Terms},
journal = {{BIT}},
volume = {32},
number = {1},
pages = {30--44},
year = {1992},
url = {https://doi.org/10.1007/BF01995106},
doi = {10.1007/BF01995106},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/FredholmS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/GraafK92,
author = {Jeannette M. de Graaf and
Walter A. Kosters},
title = {Expected Heights in Heaps},
journal = {{BIT}},
volume = {32},
number = {4},
pages = {570--579},
year = {1992},
url = {https://doi.org/10.1007/BF01994841},
doi = {10.1007/BF01994841},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/GraafK92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Hallnas92,
author = {Lars Halln{\"{a}}s},
title = {On Systems of Definitions, Induction and Recursion},
journal = {{BIT}},
volume = {32},
number = {1},
pages = {45--63},
year = {1992},
url = {https://doi.org/10.1007/BF01995107},
doi = {10.1007/BF01995107},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Hallnas92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/HershbergerS92,
author = {John Hershberger and
Subhash Suri},
title = {Applications of a Semi-Dynamic Convex Hull Algorithm},
journal = {{BIT}},
volume = {32},
number = {2},
pages = {249--267},
year = {1992},
url = {https://doi.org/10.1007/BF01994880},
doi = {10.1007/BF01994880},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/HershbergerS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/HoshiF92,
author = {Mamoru Hoshi and
Philippe Flajolet},
title = {Page Usage in a Quadtree Index},
journal = {{BIT}},
volume = {32},
number = {3},
pages = {384--402},
year = {1992},
url = {https://doi.org/10.1007/BF02074876},
doi = {10.1007/BF02074876},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/HoshiF92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/JanHL92,
author = {Rong{-}Hong Jan and
Lih{-}Hsing Hsu and
Yueh{-}Ying Lee},
title = {The Most Vital Edges with Respect to the Number of Spanning Trees
in Two-Terminal Series-Parallel Graphs},
journal = {{BIT}},
volume = {32},
number = {3},
pages = {403--412},
year = {1992},
url = {https://doi.org/10.1007/BF02074877},
doi = {10.1007/BF02074877},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/JanHL92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/KatajainenP92,
author = {Jyrki Katajainen and
Tomi Pasanen},
title = {Stable Minimum Space Partitioning in Linear Time},
journal = {{BIT}},
volume = {32},
number = {4},
pages = {580--585},
year = {1992},
url = {https://doi.org/10.1007/BF01994842},
doi = {10.1007/BF01994842},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/KatajainenP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/KreveldOA92,
author = {Marc J. van Kreveld and
Mark H. Overmars and
Pankaj K. Agarwal},
title = {Intersection Queries in Sets of Disks},
journal = {{BIT}},
volume = {32},
number = {2},
pages = {268--279},
year = {1992},
url = {https://doi.org/10.1007/BF01994881},
doi = {10.1007/BF01994881},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/KreveldOA92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/LevcopoulosL92,
author = {Christos Levcopoulos and
Andrzej Lingas},
title = {Fast Algorithms for Greedy Triangulation},
journal = {{BIT}},
volume = {32},
number = {2},
pages = {280--296},
year = {1992},
url = {https://doi.org/10.1007/BF01994882},
doi = {10.1007/BF01994882},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/LevcopoulosL92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/LeveneL92,
author = {Mark Levene and
George Loizou},
title = {Inferring Null Join Dependencies in Relational Databases},
journal = {{BIT}},
volume = {32},
number = {3},
pages = {413--429},
year = {1992},
url = {https://doi.org/10.1007/BF02074878},
doi = {10.1007/BF02074878},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/LeveneL92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Mairson92,
author = {Harry G. Mairson},
title = {The Effect of Table Expansion on the Program Complexity of Perfect
Hash Funtions},
journal = {{BIT}},
volume = {32},
number = {3},
pages = {430--440},
year = {1992},
url = {https://doi.org/10.1007/BF02074879},
doi = {10.1007/BF02074879},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Mairson92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Mints92,
author = {Grigori Mints},
title = {Complexity of Subclasses of the Intuitionistic Propositional Calculus},
journal = {{BIT}},
volume = {32},
number = {1},
pages = {64--69},
year = {1992},
url = {https://doi.org/10.1007/BF01995108},
doi = {10.1007/BF01995108},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Mints92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/OlariuSZ92,
author = {Stephan Olariu and
James L. Schwing and
Jingyuan Zhang},
title = {A Constant-Time Channel-Assignment Algorithm on Reconfigurable Meshes},
journal = {{BIT}},
volume = {32},
number = {4},
pages = {586--597},
year = {1992},
url = {https://doi.org/10.1007/BF01994843},
doi = {10.1007/BF01994843},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/OlariuSZ92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/PalmgrenS92,
author = {Erik Palmgren and
Viggo Stoltenberg{-}Hansen},
title = {Remarks on Martin-L{\"{o}}f's Partial Type Theory},
journal = {{BIT}},
volume = {32},
number = {1},
pages = {70--83},
year = {1992},
url = {https://doi.org/10.1007/BF01995109},
doi = {10.1007/BF01995109},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/PalmgrenS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/PantziouSZ92,
author = {Grammati E. Pantziou and
Paul G. Spirakis and
Christos D. Zaroliagis},
title = {Efficient Parallel Algorithms for Shortest Paths in Planar Digraphs},
journal = {{BIT}},
volume = {32},
number = {2},
pages = {215--236},
year = {1992},
url = {https://doi.org/10.1007/BF01994878},
doi = {10.1007/BF01994878},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/PantziouSZ92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/PapadakisMP92,
author = {Thomas Papadakis and
J. Ian Munro and
Patricio V. Poblete},
title = {Average Search and Update Costs in Skip Lists},
journal = {{BIT}},
volume = {32},
number = {2},
pages = {316--332},
year = {1992},
url = {https://doi.org/10.1007/BF01994884},
doi = {10.1007/BF01994884},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/PapadakisMP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Perkins92,
author = {A. Louise Perkins},
title = {A Mixed Directed-Undirected Data Structure for a Parallel Implementation
of a Domain Decomposition Algorithm},
journal = {{BIT}},
volume = {32},
number = {4},
pages = {598--608},
year = {1992},
url = {https://doi.org/10.1007/BF01994844},
doi = {10.1007/BF01994844},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Perkins92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Salvesen92,
author = {Anne Salvesen},
title = {On Specifications, Subset Types and Interpretation of Proposition
in Type Theory},
journal = {{BIT}},
volume = {32},
number = {1},
pages = {84--101},
year = {1992},
url = {https://doi.org/10.1007/BF01995110},
doi = {10.1007/BF01995110},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Salvesen92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/YuC92,
author = {Chang{-}Wu Yu and
Gen{-}Huey Chen},
title = {The Weighted Maximum Independent Set Problem in Permutation Graphs},
journal = {{BIT}},
volume = {32},
number = {4},
pages = {609--618},
year = {1992},
url = {https://doi.org/10.1007/BF01994845},
doi = {10.1007/BF01994845},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/YuC92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ArikatiRM91,
author = {Srinivasa Rao Arikati and
C. Pandu Rangan and
Glenn K. Manacher},
title = {Efficient Reduction for Path Problems on Circular-Arc Graphs},
journal = {{BIT}},
volume = {31},
number = {2},
pages = {181--193},
year = {1991},
url = {https://doi.org/10.1007/BF01931279},
doi = {10.1007/BF01931279},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ArikatiRM91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Atkinson91,
author = {M. D. Atkinson},
title = {The Recursive Structure of Some Ordering Problems},
journal = {{BIT}},
volume = {31},
number = {2},
pages = {194--201},
year = {1991},
url = {https://doi.org/10.1007/BF01931280},
doi = {10.1007/BF01931280},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Atkinson91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/BartlingH91,
author = {Frank Bartling and
Klaus H. Hinrichs},
title = {Probabilistic Analysis of an Algorithm for Solving the \emph{k}-Dimensional
All-Nearest-Neighbors Problem by Projection},
journal = {{BIT}},
volume = {31},
number = {4},
pages = {558--565},
year = {1991},
url = {https://doi.org/10.1007/BF01933171},
doi = {10.1007/BF01933171},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/BartlingH91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ChenL91,
author = {C. Y. Chen and
H. F. Lin},
title = {Optimality Criteria of the Disk Modulo Allocation Method for Cartesian
Product Files},
journal = {{BIT}},
volume = {31},
number = {4},
pages = {566--575},
year = {1991},
url = {https://doi.org/10.1007/BF01933172},
doi = {10.1007/BF01933172},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ChenL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Eloranta91,
author = {Jaana Eloranta},
title = {Minimizing the Number of Transitions with Respect to Observation Equivalence},
journal = {{BIT}},
volume = {31},
number = {4},
pages = {576--590},
year = {1991},
url = {https://doi.org/10.1007/BF01933173},
doi = {10.1007/BF01933173},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Eloranta91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/GambosiIT91,
author = {Giorgio Gambosi and
Giuseppe F. Italiano and
Maurizio Talamo},
title = {The Set Union Problem with Dynamic Weighted Backtracking},
journal = {{BIT}},
volume = {31},
number = {3},
pages = {381--393},
year = {1991},
url = {https://doi.org/10.1007/BF01933257},
doi = {10.1007/BF01933257},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/GambosiIT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Grape91,
author = {Per Grape},
title = {Complete Problems with \emph{L}-Samplable Distributions},
journal = {{BIT}},
volume = {31},
number = {3},
pages = {394--405},
year = {1991},
url = {https://doi.org/10.1007/BF01933258},
doi = {10.1007/BF01933258},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Grape91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/GuntherW91,
author = {Oliver G{\"{u}}nther and
Eugene Wong},
title = {A Dual Approach to Detect Polyhedral Intersections in Arbitrary Demensions},
journal = {{BIT}},
volume = {31},
number = {1},
pages = {2--14},
year = {1991},
url = {https://doi.org/10.1007/BF01952778},
doi = {10.1007/BF01952778},
timestamp = {Mon, 25 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/GuntherW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Johnsen91,
author = {Ben Johnsen},
title = {Generating Binary Trees with Uniform Probability},
journal = {{BIT}},
volume = {31},
number = {1},
pages = {15--31},
year = {1991},
url = {https://doi.org/10.1007/BF01952779},
doi = {10.1007/BF01952779},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Johnsen91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/KonvalinaL91,
author = {John Konvalina and
Yi{-}Hsin Liu},
title = {Bit Strings Without \emph{q}-Separation},
journal = {{BIT}},
volume = {31},
number = {1},
pages = {32--35},
year = {1991},
url = {https://doi.org/10.1007/BF01952780},
doi = {10.1007/BF01952780},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/KonvalinaL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/KreveldB91,
author = {Marc J. van Kreveld and
Mark de Berg},
title = {Finding Squares and Rectangles in Sets of Points},
journal = {{BIT}},
volume = {31},
number = {2},
pages = {202--219},
year = {1991},
url = {https://doi.org/10.1007/BF01931281},
doi = {10.1007/BF01931281},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/KreveldB91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Lingas91,
author = {Andrzej Lingas},
title = {An Unfeasible Matching Problem},
journal = {{BIT}},
volume = {31},
number = {4},
pages = {591--597},
year = {1991},
url = {https://doi.org/10.1007/BF01933174},
doi = {10.1007/BF01933174},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Lingas91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/LiuCW91,
author = {Lung{-}Tien Liu and
Gen{-}Huey Chen and
Yue{-}Li Wang},
title = {A Note on Optimal Multiway Split Trees},
journal = {{BIT}},
volume = {31},
number = {2},
pages = {220--229},
year = {1991},
url = {https://doi.org/10.1007/BF01931282},
doi = {10.1007/BF01931282},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/LiuCW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Puustjarvi91,
author = {Juha Puustj{\"{a}}rvi},
title = {Distributed Management of Transactions in Heterogeneous Distributed
Database Systems},
journal = {{BIT}},
volume = {31},
number = {3},
pages = {406--420},
year = {1991},
url = {https://doi.org/10.1007/BF01933259},
doi = {10.1007/BF01933259},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Puustjarvi91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/SchipperO91,
author = {Haijo Schipper and
Mark H. Overmars},
title = {Dynamic Partition Trees},
journal = {{BIT}},
volume = {31},
number = {3},
pages = {421--436},
year = {1991},
url = {https://doi.org/10.1007/BF01933260},
doi = {10.1007/BF01933260},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/SchipperO91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/TeoT91,
author = {Kim{-}Heng Teo and
Tai{-}Ching Tuan},
title = {A Tight Upper Bound for the Number of Intersections Between two Rectangular
Paths},
journal = {{BIT}},
volume = {31},
number = {4},
pages = {598--606},
year = {1991},
url = {https://doi.org/10.1007/BF01933175},
doi = {10.1007/BF01933175},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/TeoT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/VaishnaviK91,
author = {Vijay K. Vaishnavi and
Timothy D. Korson},
title = {Height-Analysis of \emph{k}-Dimensional Leaf and Node Height-Balanced
Trees: {A} New Approach},
journal = {{BIT}},
volume = {31},
number = {1},
pages = {36--49},
year = {1991},
url = {https://doi.org/10.1007/BF01952781},
doi = {10.1007/BF01952781},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/VaishnaviK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/VelS91,
author = {H. Van de Vel and
Sun Shijie},
title = {A Modification of Hochbaum and Shmoys' Algorithm for Scheduling Problems},
journal = {{BIT}},
volume = {31},
number = {1},
pages = {50--52},
year = {1991},
url = {https://doi.org/10.1007/BF01952782},
doi = {10.1007/BF01952782},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/VelS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Wang91,
author = {Cao An Wang},
title = {Finding Minimal Nested Polygons},
journal = {{BIT}},
volume = {31},
number = {2},
pages = {230--236},
year = {1991},
url = {https://doi.org/10.1007/BF01931283},
doi = {10.1007/BF01931283},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Wang91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Yuan91,
author = {Shyan{-}Ming Yuan},
title = {An Efficient Fault-Tolerant Decentralized Commit Protocol for Single
Site Failure},
journal = {{BIT}},
volume = {31},
number = {1},
pages = {53--68},
year = {1991},
url = {https://doi.org/10.1007/BF01952783},
doi = {10.1007/BF01952783},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Yuan91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ZhangR91,
author = {Weixiong Zhang and
Nageswara S. V. Rao},
title = {Optimal Parallel Quicksort on Erew Pram},
journal = {{BIT}},
volume = {31},
number = {1},
pages = {69--74},
year = {1991},
url = {https://doi.org/10.1007/BF01952784},
doi = {10.1007/BF01952784},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ZhangR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Andersen90,
author = {Nils Andersen},
title = {A General Transposition Method for a Matrix on Auxiliary Store},
journal = {{BIT}},
volume = {30},
number = {1},
pages = {2--16},
year = {1990},
url = {https://doi.org/10.1007/BF01932126},
doi = {10.1007/BF01932126},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Andersen90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/BauslaughR90,
author = {Bruce L. Bauslaugh and
Frank Ruskey},
title = {Generating Alternating Permutations Lexicographically},
journal = {{BIT}},
volume = {30},
number = {1},
pages = {17--26},
year = {1990},
url = {https://doi.org/10.1007/BF01932127},
doi = {10.1007/BF01932127},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/BauslaughR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ChangL90,
author = {Chin{-}Chen Chang and
Chu{-}Hsing Lin},
title = {A Reciprocal Confluence Tree Unit and Its Applications},
journal = {{BIT}},
volume = {30},
number = {1},
pages = {27--33},
year = {1990},
url = {https://doi.org/10.1007/BF01932128},
doi = {10.1007/BF01932128},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ChangL90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ChenC90,
author = {Chiuyuan Chen and
Ruei{-}Chuan Chang},
title = {On the Minimality of Polygon Triangualtion},
journal = {{BIT}},
volume = {30},
number = {4},
pages = {570--582},
year = {1990},
url = {https://doi.org/10.1007/BF01933206},
doi = {10.1007/BF01933206},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ChenC90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/DouglasM90,
author = {Craig C. Douglas and
Willard L. Miranker},
title = {The Multilevel Principle Applied to Sorting},
journal = {{BIT}},
volume = {30},
number = {2},
pages = {177--195},
year = {1990},
url = {https://doi.org/10.1007/BF02017340},
doi = {10.1007/BF02017340},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/DouglasM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/FjallstromKLP90,
author = {Per{-}Olof Fj{\"{a}}llstr{\"{o}}m and
Jyrki Katajainen and
Christos Levcopoulos and
Ola Petersson},
title = {A Sublogarithmic Convex Hull Algorithm},
journal = {{BIT}},
volume = {30},
number = {3},
pages = {378--384},
year = {1990},
url = {https://doi.org/10.1007/BF01931655},
doi = {10.1007/BF01931655},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/FjallstromKLP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Huang90,
author = {Nen{-}Fu Huang},
title = {A Divide-and-Conquer Algorithm for Constructing Relative Neighborhood
Graph},
journal = {{BIT}},
volume = {30},
number = {2},
pages = {196--206},
year = {1990},
url = {https://doi.org/10.1007/BF02017341},
doi = {10.1007/BF02017341},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Huang90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/HuangV90,
author = {Shou{-}Hsuan Stephen Huang and
Venkatraman Viswanathan},
title = {On the Construction of Weighted Time-Optimal B-Trees},
journal = {{BIT}},
volume = {30},
number = {2},
pages = {207--215},
year = {1990},
url = {https://doi.org/10.1007/BF02017342},
doi = {10.1007/BF02017342},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/HuangV90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/JajodiaS90,
author = {Sushil Jajodia and
Frederick N. Springsteel},
title = {Lossless Outer Joins with Incomplete Information},
journal = {{BIT}},
volume = {30},
number = {1},
pages = {34--41},
year = {1990},
url = {https://doi.org/10.1007/BF01932129},
doi = {10.1007/BF01932129},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/JajodiaS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Kokosinski90,
author = {Zbigniew Kokosinski},
title = {On Generation of Permutations Through Decomposition of Symmetric Groups
Into Cosets},
journal = {{BIT}},
volume = {30},
number = {4},
pages = {583--591},
year = {1990},
url = {https://doi.org/10.1007/BF01933207},
doi = {10.1007/BF01933207},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Kokosinski90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/KuoT90,
author = {R. T. Kuo and
S. S. Tseng},
title = {On the Invariance of Male Optimal Stable Matching},
journal = {{BIT}},
volume = {30},
number = {4},
pages = {592--598},
year = {1990},
url = {https://doi.org/10.1007/BF01933208},
doi = {10.1007/BF01933208},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/KuoT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Lang90,
author = {Sheau{-}Dong Lang},
title = {Analysis of Recursive Batched Interpolation Search},
journal = {{BIT}},
volume = {30},
number = {1},
pages = {42--50},
year = {1990},
url = {https://doi.org/10.1007/BF01932130},
doi = {10.1007/BF01932130},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Lang90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/MannilaU90,
author = {Heikki Mannila and
Esko Ukkonen},
title = {Unifications, Deunifications, and Their Complexity},
journal = {{BIT}},
volume = {30},
number = {4},
pages = {599--619},
year = {1990},
url = {https://doi.org/10.1007/BF01933209},
doi = {10.1007/BF01933209},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/MannilaU90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ManolopoulosF90,
author = {Yannis Manolopoulos and
Christos Faloutsos},
title = {Analysis for the End of Block Wasted Space},
journal = {{BIT}},
volume = {30},
number = {4},
pages = {620--630},
year = {1990},
url = {https://doi.org/10.1007/BF01933210},
doi = {10.1007/BF01933210},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ManolopoulosF90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ManolopoulosK90,
author = {Yannis Manolopoulos and
John G. Kollias},
title = {Optimal Data Placement in Two-Headed Disk Systems},
journal = {{BIT}},
volume = {30},
number = {2},
pages = {216--219},
year = {1990},
url = {https://doi.org/10.1007/BF02017343},
doi = {10.1007/BF02017343},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ManolopoulosK90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/MunroRS90,
author = {J. Ian Munro and
Venkatesh Raman and
Jeffrey S. Salowe},
title = {Stable in Situ Sorting and Minimum Data Movement},
journal = {{BIT}},
volume = {30},
number = {2},
pages = {220--234},
year = {1990},
url = {https://doi.org/10.1007/BF02017344},
doi = {10.1007/BF02017344},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/MunroRS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/OvermarsSS90,
author = {Mark H. Overmars and
Haijo Schipper and
Micha Sharir},
title = {Storing Line Segments in Partition Trees},
journal = {{BIT}},
volume = {30},
number = {3},
pages = {385--403},
year = {1990},
url = {https://doi.org/10.1007/BF01931656},
doi = {10.1007/BF01931656},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/OvermarsSS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/RamamohanaraoSS90,
author = {Kotagiri Ramamohanarao and
John Shepherd and
Ron Sacks{-}Davis},
title = {Multi-Attribute Hashing with Multiple File Copies for High Performance
Partial-Match Retrieval},
journal = {{BIT}},
volume = {30},
number = {3},
pages = {404--423},
year = {1990},
url = {https://doi.org/10.1007/BF01931657},
doi = {10.1007/BF01931657},
timestamp = {Tue, 08 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bit/RamamohanaraoSS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Robison90,
author = {Arch Douglas Robison},
title = {An Improved Rewriting-Number Algorithm},
journal = {{BIT}},
volume = {30},
number = {1},
pages = {51--61},
year = {1990},
url = {https://doi.org/10.1007/BF01932131},
doi = {10.1007/BF01932131},
timestamp = {Mon, 16 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Robison90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Sprugnoli90,
author = {Renzo Sprugnoli},
title = {Counting Labels in Binary Trees},
journal = {{BIT}},
volume = {30},
number = {1},
pages = {62--69},
year = {1990},
url = {https://doi.org/10.1007/BF01932132},
doi = {10.1007/BF01932132},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Sprugnoli90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Stewart90,
author = {Alan Stewart},
title = {An Axiomatic Treatment of {SIMD} Assignment},
journal = {{BIT}},
volume = {30},
number = {1},
pages = {70--82},
year = {1990},
url = {https://doi.org/10.1007/BF01932133},
doi = {10.1007/BF01932133},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Stewart90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Stojmenovic90,
author = {Ivan Stojmenovic},
title = {An Optimal Algorithm for Generating Equivalence Relations on a Linear
Array of Processors},
journal = {{BIT}},
volume = {30},
number = {3},
pages = {424--436},
year = {1990},
url = {https://doi.org/10.1007/BF01931658},
doi = {10.1007/BF01931658},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Stojmenovic90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/SysloW90,
author = {Maciej M. Syslo and
Pawel Winter},
title = {In-Trees and Plane Embeddings of Outerplanar Graphs},
journal = {{BIT}},
volume = {30},
number = {1},
pages = {83--90},
year = {1990},
url = {https://doi.org/10.1007/BF01932134},
doi = {10.1007/BF01932134},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/SysloW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Tan90,
author = {Jimmy J. M. Tan},
title = {A Maximum Stable Matching for the Roommates Problem},
journal = {{BIT}},
volume = {30},
number = {4},
pages = {631--640},
year = {1990},
url = {https://doi.org/10.1007/BF01933211},
doi = {10.1007/BF01933211},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Tan90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Tarhio90,
author = {Jorma Tarhio},
title = {Uncle-Atrributed Grammars},
journal = {{BIT}},
volume = {30},
number = {3},
pages = {437--449},
year = {1990},
url = {https://doi.org/10.1007/BF01931659},
doi = {10.1007/BF01931659},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Tarhio90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Varadarajan90,
author = {Ravi Varadarajan},
title = {Partitioning Multi-Edge Graphs},
journal = {{BIT}},
volume = {30},
number = {3},
pages = {450--463},
year = {1990},
url = {https://doi.org/10.1007/BF01931660},
doi = {10.1007/BF01931660},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Varadarajan90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Winters90,
author = {Vincent G. Winters},
title = {Minimal Perfect Hashing in Polynomial Time},
journal = {{BIT}},
volume = {30},
number = {2},
pages = {235--244},
year = {1990},
url = {https://doi.org/10.1007/BF02017345},
doi = {10.1007/BF02017345},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Winters90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ZubairG90,
author = {Mohammad Zubair and
S. N. Gupta},
title = {Embeddings on a Boolean Cube},
journal = {{BIT}},
volume = {30},
number = {2},
pages = {245--256},
year = {1990},
url = {https://doi.org/10.1007/BF02017346},
doi = {10.1007/BF02017346},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ZubairG90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Baeza-Yates89,
author = {Ricardo A. Baeza{-}Yates},
title = {A Trivial Algorithm Whose Analysis is Not: {A} Continuation},
journal = {{BIT}},
volume = {29},
number = {3},
pages = {378--394},
year = {1989},
url = {https://doi.org/10.1007/BF02219226},
doi = {10.1007/BF02219226},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Baeza-Yates89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Galle89,
author = {Per Galle},
title = {Branch {\&} Sample: {A} Simple Strategy for Constraint Satisfaction},
journal = {{BIT}},
volume = {29},
number = {3},
pages = {395--408},
year = {1989},
url = {https://doi.org/10.1007/BF02219227},
doi = {10.1007/BF02219227},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Galle89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/GoriS89,
author = {Marco Gori and
Giovanni Soda},
title = {An Algebraic Approach to Cichelli's Perfect Hashing},
journal = {{BIT}},
volume = {29},
number = {1},
pages = {2--13},
year = {1989},
url = {https://doi.org/10.1007/BF01932700},
doi = {10.1007/BF01932700},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/GoriS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/GroppI89,
author = {William Gropp and
Ilse C. F. Ipsen},
title = {Recursive Mesh Refinement on Hypercubes},
journal = {{BIT}},
volume = {29},
number = {2},
pages = {186--211},
year = {1989},
url = {https://doi.org/10.1007/BF01952675},
doi = {10.1007/BF01952675},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/GroppI89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/GuptaB89,
author = {P. Gupta and
G. P. Bhattacharjee},
title = {A Parallel Derangement Generation Algorithm},
journal = {{BIT}},
volume = {29},
number = {1},
pages = {14--22},
year = {1989},
url = {https://doi.org/10.1007/BF01932701},
doi = {10.1007/BF01932701},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/GuptaB89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/HuangH89,
author = {Nen{-}Fu Huang and
Tsing{-}Her Huang},
title = {On the Complexity of Some Arborescences Finding Problems on a Multihop
Radio Network},
journal = {{BIT}},
volume = {29},
number = {2},
pages = {212--216},
year = {1989},
url = {https://doi.org/10.1007/BF01952676},
doi = {10.1007/BF01952676},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/HuangH89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/HuangT89,
author = {Shing{-}Tsaan Huang and
Ming{-}Shin Tsai},
title = {A Linear Systolic Algorithm for the Connected Component Problem},
journal = {{BIT}},
volume = {29},
number = {2},
pages = {217--226},
year = {1989},
url = {https://doi.org/10.1007/BF01952677},
doi = {10.1007/BF01952677},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/HuangT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Jokinen89,
author = {Matti O. Jokinen},
title = {Automatically Replacing Indices Into Parallel Arrays with Pointers
to Records},
journal = {{BIT}},
volume = {29},
number = {2},
pages = {227--238},
year = {1989},
url = {https://doi.org/10.1007/BF01952678},
doi = {10.1007/BF01952678},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Jokinen89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/LinT89,
author = {Chau{-}Jy Lin and
Jong{-}Chuang Tsay},
title = {A Systolic Generation of Combinations},
journal = {{BIT}},
volume = {29},
number = {1},
pages = {23--36},
year = {1989},
url = {https://doi.org/10.1007/BF01932702},
doi = {10.1007/BF01932702},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/LinT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/MelhemG89,
author = {Rami G. Melhem and
Concettina Guerra},
title = {The Application of a Sequence Notation to the Design of Systolic Computations},
journal = {{BIT}},
volume = {29},
number = {3},
pages = {409--427},
year = {1989},
url = {https://doi.org/10.1007/BF02219228},
doi = {10.1007/BF02219228},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/MelhemG89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Quinn89,
author = {Michael J. Quinn},
title = {Analysis and Benchmarking of Two Parallel Sorting Algorithms: Hyperquicksort
and Quickmerge},
journal = {{BIT}},
volume = {29},
number = {2},
pages = {239--250},
year = {1989},
url = {https://doi.org/10.1007/BF01952679},
doi = {10.1007/BF01952679},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Quinn89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ScheuermannPO89,
author = {Peter Scheuermann and
Young Chul Park and
Edward Omiecinski},
title = {A Heuristic File Reorganization Algorithm Based on Record Clustering},
journal = {{BIT}},
volume = {29},
number = {3},
pages = {428--447},
year = {1989},
url = {https://doi.org/10.1007/BF02219229},
doi = {10.1007/BF02219229},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ScheuermannPO89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Selmer89,
author = {Ernst S. Selmer},
title = {On Shellsort and the Frobenius Problem},
journal = {{BIT}},
volume = {29},
number = {1},
pages = {37--40},
year = {1989},
url = {https://doi.org/10.1007/BF01932703},
doi = {10.1007/BF01932703},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Selmer89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/StrothotteEV89,
author = {Thomas Strothotte and
Patrik Eriksson and
S{\"{o}}ren Vallner},
title = {A Note on Constructing Min-Max Heaps},
journal = {{BIT}},
volume = {29},
number = {2},
pages = {251--256},
year = {1989},
url = {https://doi.org/10.1007/BF01952680},
doi = {10.1007/BF01952680},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/StrothotteEV89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Tseng89,
author = {S. S. Tseng},
title = {The Average Performance of a Parallel Stable Marriage Algorithm},
journal = {{BIT}},
volume = {29},
number = {3},
pages = {448--456},
year = {1989},
url = {https://doi.org/10.1007/BF02219230},
doi = {10.1007/BF02219230},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Tseng89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Veklerov89,
author = {Eugene Veklerov},
title = {On the Decomposability of the Stable Marriage Problem},
journal = {{BIT}},
volume = {29},
number = {1},
pages = {41--46},
year = {1989},
url = {https://doi.org/10.1007/BF01932704},
doi = {10.1007/BF01932704},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Veklerov89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/AasaHN88,
author = {Annika Aasa and
S{\"{o}}ren Holmstr{\"{o}}m and
Christina Nilsson},
title = {An Efficiency Comparison of Some Representations of Purely Functional
Arrays},
journal = {{BIT}},
volume = {28},
number = {3},
pages = {489--503},
year = {1988},
url = {https://doi.org/10.1007/BF01941130},
doi = {10.1007/BF01941130},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/AasaHN88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Aurenhammer88,
author = {Franz Aurenhammer},
title = {On-Line Sorting of Twisted Sequences in Linear Time},
journal = {{BIT}},
volume = {28},
number = {2},
pages = {194--204},
year = {1988},
url = {https://doi.org/10.1007/BF01934085},
doi = {10.1007/BF01934085},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Aurenhammer88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/BakkerM88,
author = {J. W. de Bakker and
John{-}Jules Ch. Meyer},
title = {Metric Semantics for Concurrency},
journal = {{BIT}},
volume = {28},
number = {3},
pages = {504--529},
year = {1988},
url = {https://doi.org/10.1007/BF01941131},
doi = {10.1007/BF01941131},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/BakkerM88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/BeckK88,
author = {Istv{\'{a}}n Beck and
Stein Krogdahl},
title = {A Select and Insert Sorting Algorithm},
journal = {{BIT}},
volume = {28},
number = {4},
pages = {725--735},
year = {1988},
url = {https://doi.org/10.1007/BF01954893},
doi = {10.1007/BF01954893},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/BeckK88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Blum88,
author = {Edward K. Blum},
title = {The Semantics and Complexity of Parallel Programs for Vector Computations.
Part {I:} {A} Case Study Using Ada},
journal = {{BIT}},
volume = {28},
number = {3},
pages = {530--551},
year = {1988},
url = {https://doi.org/10.1007/BF01941132},
doi = {10.1007/BF01941132},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Blum88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Chang88,
author = {Chin{-}Chen Chang},
title = {Application of Principal Component Analysis to Multi-Disk Concurrent
Accessing},
journal = {{BIT}},
volume = {28},
number = {2},
pages = {205--214},
year = {1988},
url = {https://doi.org/10.1007/BF01934086},
doi = {10.1007/BF01934086},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Chang88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Chaudhuri88,
author = {Pranay Chaudhuri},
title = {Fast Parallel Graph Searching with Applications},
journal = {{BIT}},
volume = {28},
number = {1},
pages = {1--18},
year = {1988},
url = {https://doi.org/10.1007/BF01934690},
doi = {10.1007/BF01934690},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Chaudhuri88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ClausenK88,
author = {Jens Clausen and
Jakob Krarup},
title = {Arranging Apples in an Array},
journal = {{BIT}},
volume = {28},
number = {3},
pages = {552--568},
year = {1988},
url = {https://doi.org/10.1007/BF01941133},
doi = {10.1007/BF01941133},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ClausenK88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Dijkstra88,
author = {Edsger W. Dijkstra},
title = {On Binary Operators and Their Derived Relations},
journal = {{BIT}},
volume = {28},
number = {3},
pages = {377--382},
year = {1988},
url = {https://doi.org/10.1007/BF01941120},
doi = {10.1007/BF01941120},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Dijkstra88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Einarsson88,
author = {Bo Einarsson},
title = {Tutorial on Analytical Methods as a Complement ot Numerical Computing},
journal = {{BIT}},
volume = {28},
number = {3},
pages = {383--390},
year = {1988},
url = {https://doi.org/10.1007/BF01941121},
doi = {10.1007/BF01941121},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Einarsson88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ErdosR88,
author = {Paul Erd{\"{o}}s and
Hans Riesel},
title = {On Admissible Constellations of Consecutive Primes},
journal = {{BIT}},
volume = {28},
number = {3},
pages = {391--396},
year = {1988},
url = {https://doi.org/10.1007/BF01941122},
doi = {10.1007/BF01941122},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ErdosR88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Ershov88,
author = {Andrei P. Ershov},
title = {Basic Concepts of Algorithms and Programming to be Taught in a School
Course in Informatics},
journal = {{BIT}},
volume = {28},
number = {3},
pages = {397--405},
year = {1988},
url = {https://doi.org/10.1007/BF01941123},
doi = {10.1007/BF01941123},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Ershov88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Faloutsos88,
author = {Christos Faloutsos},
title = {Signature Files: An Integrated Access Method for Text and Attributes,
Sluitable for Optical Disk Storage},
journal = {{BIT}},
volume = {28},
number = {4},
pages = {736--754},
year = {1988},
url = {https://doi.org/10.1007/BF01954894},
doi = {10.1007/BF01954894},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Faloutsos88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Froberg88,
author = {Carl{-}Erik Fr{\"{o}}berg},
title = {On a Combinatorial Problem Related to Permanents},
journal = {{BIT}},
volume = {28},
number = {3},
pages = {406--411},
year = {1988},
url = {https://doi.org/10.1007/BF01941124},
doi = {10.1007/BF01941124},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Froberg88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Gibson88,
author = {J. K. Gibson},
title = {A Generalisation of Brickell's Algorithm for Fast Modular Multiplication},
journal = {{BIT}},
volume = {28},
number = {4},
pages = {755--763},
year = {1988},
url = {https://doi.org/10.1007/BF01954895},
doi = {10.1007/BF01954895},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Gibson88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/GriesX88,
author = {David Gries and
Jinyun Xue},
title = {Generating a Random Cycle Permutation},
journal = {{BIT}},
volume = {28},
number = {3},
pages = {569--572},
year = {1988},
url = {https://doi.org/10.1007/BF01941134},
doi = {10.1007/BF01941134},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/GriesX88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Huang88,
author = {Shou{-}Hsuan Stephen Huang},
title = {A {VLSI} Partition Algorithm},
journal = {{BIT}},
volume = {28},
number = {2},
pages = {215--226},
year = {1988},
url = {https://doi.org/10.1007/BF01934087},
doi = {10.1007/BF01934087},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Huang88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Johansen88,
author = {Peter Johansen},
title = {Inductive Inference of Ultimately Periodic Sequences},
journal = {{BIT}},
volume = {28},
number = {3},
pages = {573--580},
year = {1988},
url = {https://doi.org/10.1007/BF01941135},
doi = {10.1007/BF01941135},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Johansen88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Karlsson88,
author = {Rolf G. Karlsson},
title = {Greedy Matching on a Grid},
journal = {{BIT}},
volume = {28},
number = {1},
pages = {19--26},
year = {1988},
url = {https://doi.org/10.1007/BF01934691},
doi = {10.1007/BF01934691},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Karlsson88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/KarlssonO88,
author = {Rolf G. Karlsson and
Mark H. Overmars},
title = {Scanline Algorithms on a Grid},
journal = {{BIT}},
volume = {28},
number = {2},
pages = {227--241},
year = {1988},
url = {https://doi.org/10.1007/BF01934088},
doi = {10.1007/BF01934088},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/KarlssonO88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Kurki-SuonioK88,
author = {Reino Kurki{-}Suonio and
T. Kankaanp{\"{a}}{\"{a}}},
title = {On the Design of Reactive Systems},
journal = {{BIT}},
volume = {28},
number = {3},
pages = {581--604},
year = {1988},
url = {https://doi.org/10.1007/BF01941136},
doi = {10.1007/BF01941136},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Kurki-SuonioK88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ManolopoulosK88,
author = {Yannis Manolopoulos and
John G. Kollias},
title = {Estimating Disk Head Movement in Batched Searching},
journal = {{BIT}},
volume = {28},
number = {1},
pages = {27--36},
year = {1988},
url = {https://doi.org/10.1007/BF01934692},
doi = {10.1007/BF01934692},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ManolopoulosK88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Mayoh88,
author = {Brian H. Mayoh},
title = {On Formalisms},
journal = {{BIT}},
volume = {28},
number = {3},
pages = {412--426},
year = {1988},
url = {https://doi.org/10.1007/BF01941125},
doi = {10.1007/BF01941125},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Mayoh88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/NicolaouL88,
author = {P. P. Nicolaou and
C. C. Lefas},
title = {On the Recovery of Error Patterns from Signatures Obtained in Digital
System Testing},
journal = {{BIT}},
volume = {28},
number = {2},
pages = {242--252},
year = {1988},
url = {https://doi.org/10.1007/BF01934089},
doi = {10.1007/BF01934089},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/NicolaouL88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Nordstrom88,
author = {Bengt Nordstr{\"{o}}m},
title = {Terminating General Recursion},
journal = {{BIT}},
volume = {28},
number = {3},
pages = {605--619},
year = {1988},
url = {https://doi.org/10.1007/BF01941137},
doi = {10.1007/BF01941137},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Nordstrom88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/RaoVI88,
author = {Nageswara S. V. Rao and
Vijay K. Vaishnavi and
S. Sitharama Iyengar},
title = {On the Dynamization of Data Structures},
journal = {{BIT}},
volume = {28},
number = {1},
pages = {37--53},
year = {1988},
url = {https://doi.org/10.1007/BF01934693},
doi = {10.1007/BF01934693},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/RaoVI88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/RavnRL88,
author = {Anders P. Ravn and
Hans Rischel and
Hans Henrik L{\o}vengreen},
title = {A Design Method for Embedded Software Systems},
journal = {{BIT}},
volume = {28},
number = {3},
pages = {427--438},
year = {1988},
url = {https://doi.org/10.1007/BF01941126},
doi = {10.1007/BF01941126},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/RavnRL88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/RichardsV88,
author = {Dana S. Richards and
Pravin M. Vaidya},
title = {On the Distribution of Comparisons in Sorting Algorithms},
journal = {{BIT}},
volume = {28},
number = {4},
pages = {764--774},
year = {1988},
url = {https://doi.org/10.1007/BF01954896},
doi = {10.1007/BF01954896},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/RichardsV88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Skiena88,
author = {Steven Skiena},
title = {Encroaching Lists as a Measure of Presortedness},
journal = {{BIT}},
volume = {28},
number = {4},
pages = {775--784},
year = {1988},
url = {https://doi.org/10.1007/BF01954897},
doi = {10.1007/BF01954897},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Skiena88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Smillie88,
author = {Keith W. Smillie},
title = {Array Theory and the Nial Programming Language},
journal = {{BIT}},
volume = {28},
number = {3},
pages = {439--449},
year = {1988},
url = {https://doi.org/10.1007/BF01941127},
doi = {10.1007/BF01941127},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Smillie88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/StaunstrupG88,
author = {J{\o}rgen Staunstrup and
Mark R. Greenstreet},
title = {From High-Level Descriptions to {VLSI} Circuits},
journal = {{BIT}},
volume = {28},
number = {3},
pages = {620--638},
year = {1988},
url = {https://doi.org/10.1007/BF01941138},
doi = {10.1007/BF01941138},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/StaunstrupG88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Stewart88,
author = {Alan Stewart},
title = {{SIMD} Language Design Using Prescriptive Semantics},
journal = {{BIT}},
volume = {28},
number = {3},
pages = {639--649},
year = {1988},
url = {https://doi.org/10.1007/BF01941139},
doi = {10.1007/BF01941139},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Stewart88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/StojmenovicL88,
author = {Ivan Stojmenovic and
Michael A. Langston},
title = {On a Proposed Divide-And-Conquer Minimal Spanning Tree Algorithm},
journal = {{BIT}},
volume = {28},
number = {4},
pages = {785--789},
year = {1988},
url = {https://doi.org/10.1007/BF01954898},
doi = {10.1007/BF01954898},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/StojmenovicL88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/SveinsdottirF88,
author = {Edda Sveinsdottir and
Erik Fr{\o}kj{\ae}r},
title = {Datalogy - The Copenhagen Tradition of Computer Science},
journal = {{BIT}},
volume = {28},
number = {3},
pages = {450--472},
year = {1988},
url = {https://doi.org/10.1007/BF01941128},
doi = {10.1007/BF01941128},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bit/SveinsdottirF88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Turski88,
author = {Wladyslaw M. Turski},
title = {Time Considered Irrelevant for Real-Time Systems},
journal = {{BIT}},
volume = {28},
number = {3},
pages = {473--486},
year = {1988},
url = {https://doi.org/10.1007/BF01941129},
doi = {10.1007/BF01941129},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Turski88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/WangT88,
author = {Ling{-}Ling Wang and
Wen{-}Hsiang Tsai},
title = {Optimal Assignment of Task Modules with Precedence for Distributed
Processing by Graph Matching and State-Space Search},
journal = {{BIT}},
volume = {28},
number = {1},
pages = {54--68},
year = {1988},
url = {https://doi.org/10.1007/BF01934694},
doi = {10.1007/BF01934694},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/WangT88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/BassiouniK87,
author = {Mostafa A. Bassiouni and
U. Khamare},
title = {Algorithms for Reducing Rollbacks in Concurrency Control by Certification},
journal = {{BIT}},
volume = {27},
number = {4},
pages = {441--457},
year = {1987},
url = {https://doi.org/10.1007/BF01937270},
doi = {10.1007/BF01937270},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/BassiouniK87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Belik87,
author = {Ferenc Belik},
title = {Deadlock Avoidance with a Modified Banker's Algorithm},
journal = {{BIT}},
volume = {27},
number = {3},
pages = {290--305},
year = {1987},
url = {https://doi.org/10.1007/BF01933724},
doi = {10.1007/BF01933724},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Belik87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/BurgdorffJSZ87,
author = {H. A. Burgdorff and
Sushil Jajodia and
Frederick N. Springsteel and
Yechezkel Zalcstein},
title = {Alternative Methods for the Reconstruction of Trees from Their Traversals},
journal = {{BIT}},
volume = {27},
number = {2},
pages = {133--140},
year = {1987},
url = {https://doi.org/10.1007/BF01934177},
doi = {10.1007/BF01934177},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/BurgdorffJSZ87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Carlsson87,
author = {Svante Carlsson},
title = {Average-Case Results on Heapsort},
journal = {{BIT}},
volume = {27},
number = {1},
pages = {2--17},
year = {1987},
url = {https://doi.org/10.1007/BF01937350},
doi = {10.1007/BF01937350},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Carlsson87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ChangC87,
author = {Chin{-}Chen Chang and
C. Y. Chen},
title = {Performance of Two-Disk Partition Data Allocations},
journal = {{BIT}},
volume = {27},
number = {3},
pages = {306--314},
year = {1987},
url = {https://doi.org/10.1007/BF01933725},
doi = {10.1007/BF01933725},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ChangC87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ChenCL87,
author = {Gen{-}Huey Chen and
Maw{-}Sheng Chern and
Richard C. T. Lee},
title = {A New Systolic Architecture for Convex Hull and Half-Plane Intersection
Problems},
journal = {{BIT}},
volume = {27},
number = {2},
pages = {141--147},
year = {1987},
url = {https://doi.org/10.1007/BF01934178},
doi = {10.1007/BF01934178},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ChenCL87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/DoroslovackiST87,
author = {Rade Doroslovacki and
Ivan Stojmenovic and
Ratko Tosic},
title = {Generating and Counting Triangular Systems},
journal = {{BIT}},
volume = {27},
number = {1},
pages = {18--24},
year = {1987},
url = {https://doi.org/10.1007/BF01937351},
doi = {10.1007/BF01937351},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/DoroslovackiST87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/FriesenL87,
author = {Donald K. Friesen and
Michael A. Langston},
title = {Bin Packing: On Optimizing the Number of Pieces Packed},
journal = {{BIT}},
volume = {27},
number = {2},
pages = {148--156},
year = {1987},
url = {https://doi.org/10.1007/BF01934179},
doi = {10.1007/BF01934179},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/FriesenL87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/HashamS87,
author = {A. Hasham and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Bounds for Min-Max Heaps},
journal = {{BIT}},
volume = {27},
number = {3},
pages = {315--323},
year = {1987},
url = {https://doi.org/10.1007/BF01933726},
doi = {10.1007/BF01933726},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/HashamS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/JoeS87,
author = {Barry Joe and
R. B. Simpson},
title = {Corrections to Lee's Visibility Polygon Algorithm},
journal = {{BIT}},
volume = {27},
number = {4},
pages = {458--473},
year = {1987},
url = {https://doi.org/10.1007/BF01937271},
doi = {10.1007/BF01937271},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/JoeS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/LeeuwenW87,
author = {Jan van Leeuwen and
Jir{\'{\i}} Wiedermann},
title = {Array Processing Machines: An Abstract Model},
journal = {{BIT}},
volume = {27},
number = {1},
pages = {25--43},
year = {1987},
url = {https://doi.org/10.1007/BF01937352},
doi = {10.1007/BF01937352},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/LeeuwenW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/LingasLS87,
author = {Andrzej Lingas and
Christos Levcopoulos and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Algorithms for Minimum Length Partitions of Polygons},
journal = {{BIT}},
volume = {27},
number = {4},
pages = {474--479},
year = {1987},
url = {https://doi.org/10.1007/BF01937272},
doi = {10.1007/BF01937272},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/LingasLS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/LoizouT87,
author = {George Loizou and
Peter Thanisch},
title = {On Finding a Worst-Case Optimal Fourth Normal Form Database Decomposition},
journal = {{BIT}},
volume = {27},
number = {2},
pages = {157--162},
year = {1987},
url = {https://doi.org/10.1007/BF01934180},
doi = {10.1007/BF01934180},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/LoizouT87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Makinen87,
author = {Erkki M{\"{a}}kinen},
title = {Left Distance Binary Tree Representations},
journal = {{BIT}},
volume = {27},
number = {2},
pages = {163--169},
year = {1987},
url = {https://doi.org/10.1007/BF01934181},
doi = {10.1007/BF01934181},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Makinen87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Makinen87a,
author = {Erkki M{\"{a}}kinen},
title = {On Top-Down Splaying},
journal = {{BIT}},
volume = {27},
number = {3},
pages = {330--339},
year = {1987},
url = {https://doi.org/10.1007/BF01933728},
doi = {10.1007/BF01933728},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Makinen87a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Melhem87,
author = {Rami G. Melhem},
title = {Verification of a Class of Self-Timed Computational Networks},
journal = {{BIT}},
volume = {27},
number = {4},
pages = {480--500},
year = {1987},
url = {https://doi.org/10.1007/BF01937273},
doi = {10.1007/BF01937273},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Melhem87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/MunroP87,
author = {J. Ian Munro and
Patricio V. Poblete},
title = {Searchability in Merging and Implicit Data Structures},
journal = {{BIT}},
volume = {27},
number = {3},
pages = {324--329},
year = {1987},
url = {https://doi.org/10.1007/BF01933727},
doi = {10.1007/BF01933727},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/MunroP87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Noga87,
author = {Mark T. Noga},
title = {Sorting in Parallel by Double Distributive Partitioning},
journal = {{BIT}},
volume = {27},
number = {3},
pages = {340--348},
year = {1987},
url = {https://doi.org/10.1007/BF01933729},
doi = {10.1007/BF01933729},
timestamp = {Sat, 13 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Noga87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Pawagi87,
author = {Shaunak Pawagi},
title = {Maximum Weight Independent Set in Trees},
journal = {{BIT}},
volume = {27},
number = {2},
pages = {170--180},
year = {1987},
url = {https://doi.org/10.1007/BF01934182},
doi = {10.1007/BF01934182},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Pawagi87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Wegner87,
author = {Lutz M. Wegner},
title = {A Generalized, One-Way, Stackless Quicksort},
journal = {{BIT}},
volume = {27},
number = {1},
pages = {44--48},
year = {1987},
url = {https://doi.org/10.1007/BF01937353},
doi = {10.1007/BF01937353},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Wegner87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Berztiss86,
author = {Alfs T. Berztiss},
title = {A Taxonomy of Binary Tree Traversals},
journal = {{BIT}},
volume = {26},
number = {3},
pages = {266--276},
year = {1986},
url = {https://doi.org/10.1007/BF01933706},
doi = {10.1007/BF01933706},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Berztiss86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Brinck86,
author = {Keith Brinck},
title = {Computing Parent Nodes in Threaded Binary Trees},
journal = {{BIT}},
volume = {26},
number = {4},
pages = {401--409},
year = {1986},
url = {https://doi.org/10.1007/BF01935047},
doi = {10.1007/BF01935047},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Brinck86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ChanA86,
author = {Becky Chan and
Selim G. Akl},
title = {Generating Combinations in Parallel},
journal = {{BIT}},
volume = {26},
number = {1},
pages = {1--6},
year = {1986},
url = {https://doi.org/10.1007/BF01939357},
doi = {10.1007/BF01939357},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ChanA86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Chang86,
author = {Chin{-}Chen Chang},
title = {On the Design of a Key-Lock-Pair Mechanism in Information Protection
Systems},
journal = {{BIT}},
volume = {26},
number = {4},
pages = {410--417},
year = {1986},
url = {https://doi.org/10.1007/BF01935048},
doi = {10.1007/BF01935048},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Chang86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ChangL86,
author = {R. C. Chang and
Richard C. T. Lee},
title = {An \emph{O}(\emph{N} log \emph{N}) Minimal Spanning Tree Algorithm
for \emph{N} Points in the Plane},
journal = {{BIT}},
volume = {26},
number = {1},
pages = {7--16},
year = {1986},
url = {https://doi.org/10.1007/BF01939358},
doi = {10.1007/BF01939358},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ChangL86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ChaudhuriG86,
author = {Pranay Chaudhuri and
Ratan K. Ghosh},
title = {Parallel Algorithms for Analyzing Activity Networks},
journal = {{BIT}},
volume = {26},
number = {4},
pages = {418--429},
year = {1986},
url = {https://doi.org/10.1007/BF01935049},
doi = {10.1007/BF01935049},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ChaudhuriG86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ChenC86,
author = {Gen{-}Huey Chen and
Maw{-}Sheng Chern},
title = {Parallel Generation of Permutations and Conbinations},
journal = {{BIT}},
volume = {26},
number = {3},
pages = {277--283},
year = {1986},
url = {https://doi.org/10.1007/BF01933707},
doi = {10.1007/BF01933707},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ChenC86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Du86,
author = {Hung{-}Chang Du},
title = {Disk Allocation Methods for Binary Cartesian Product Files},
journal = {{BIT}},
volume = {26},
number = {2},
pages = {138--147},
year = {1986},
url = {https://doi.org/10.1007/BF01933739},
doi = {10.1007/BF01933739},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Du86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Edenbrandt86,
author = {Anders Edenbrandt},
title = {Quotient Tree Partitioning of Undirected Graphs},
journal = {{BIT}},
volume = {26},
number = {2},
pages = {148--155},
year = {1986},
url = {https://doi.org/10.1007/BF01933740},
doi = {10.1007/BF01933740},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Edenbrandt86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/FranklinA86,
author = {Wm. Randolph Franklin and
Varol Akman},
title = {Reconstructing Visible Regions from Visible Segments},
journal = {{BIT}},
volume = {26},
number = {4},
pages = {430--441},
year = {1986},
url = {https://doi.org/10.1007/BF01935050},
doi = {10.1007/BF01935050},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/FranklinA86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Huang86,
author = {Shou{-}Hsuan Stephen Huang},
title = {Ordered Priority Queues},
journal = {{BIT}},
volume = {26},
number = {4},
pages = {442--450},
year = {1986},
url = {https://doi.org/10.1007/BF01935051},
doi = {10.1007/BF01935051},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Huang86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Kingston86,
author = {Jeffrey H. Kingston},
title = {The Amortized Complexity of Henriksen's Algorithm},
journal = {{BIT}},
volume = {26},
number = {2},
pages = {156--163},
year = {1986},
url = {https://doi.org/10.1007/BF01933741},
doi = {10.1007/BF01933741},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Kingston86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/KrarupP86,
author = {Jakob Krarup and
Peter M. Pruzan},
title = {Assessment of Approximate Algorithms: The Error Measure's Crucial
Role},
journal = {{BIT}},
volume = {26},
number = {3},
pages = {284--294},
year = {1986},
url = {https://doi.org/10.1007/BF01933708},
doi = {10.1007/BF01933708},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/KrarupP86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Louchard86,
author = {Guy Louchard},
title = {Brownian Motion and Algorithm Complexity},
journal = {{BIT}},
volume = {26},
number = {1},
pages = {17--34},
year = {1986},
url = {https://doi.org/10.1007/BF01939359},
doi = {10.1007/BF01939359},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Louchard86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Meldal86,
author = {Sigurd Meldal},
title = {An Axiomatic Semantics for Nested Concurrency},
journal = {{BIT}},
volume = {26},
number = {2},
pages = {164--174},
year = {1986},
url = {https://doi.org/10.1007/BF01933742},
doi = {10.1007/BF01933742},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Meldal86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Meldal86a,
author = {Sigurd Meldal},
title = {Partial Correctness of Exits from Concurrent Structures},
journal = {{BIT}},
volume = {26},
number = {3},
pages = {295--302},
year = {1986},
url = {https://doi.org/10.1007/BF01933709},
doi = {10.1007/BF01933709},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Meldal86a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Naur86,
author = {Peter Naur},
title = {Thinking and Turing's Test},
journal = {{BIT}},
volume = {26},
number = {2},
pages = {175--187},
year = {1986},
url = {https://doi.org/10.1007/BF01933743},
doi = {10.1007/BF01933743},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Naur86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/QuinnD86,
author = {Michael J. Quinn and
Narsingh Deo},
title = {An Upper Bound for the Speedup of Parallel Best-Bound Branch-And-Bound
Algorithms},
journal = {{BIT}},
volume = {26},
number = {1},
pages = {35--43},
year = {1986},
url = {https://doi.org/10.1007/BF01939360},
doi = {10.1007/BF01939360},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/QuinnD86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/SaikkonenR86,
author = {Heikki Saikkonen and
Stefan R{\"{o}}nn},
title = {Distributed Termination on a Ring},
journal = {{BIT}},
volume = {26},
number = {2},
pages = {188--194},
year = {1986},
url = {https://doi.org/10.1007/BF01933744},
doi = {10.1007/BF01933744},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/SaikkonenR86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Schreiber86,
author = {Robert Schreiber},
title = {On Systolic Array Methods for Band Matrix Factorizations},
journal = {{BIT}},
volume = {26},
number = {3},
pages = {303--316},
year = {1986},
url = {https://doi.org/10.1007/BF01933710},
doi = {10.1007/BF01933710},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Schreiber86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/SchreiberT86,
author = {Robert Schreiber and
Wei{-}Pai Tang},
title = {On On Systolic Arrays for Updating the Cholesky Factorization},
journal = {{BIT}},
volume = {26},
number = {4},
pages = {451--466},
year = {1986},
url = {https://doi.org/10.1007/BF01935052},
doi = {10.1007/BF01935052},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/SchreiberT86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Winter86,
author = {Pawel Winter},
title = {An Algorithm for the Enumeration of Spanning Trees},
journal = {{BIT}},
volume = {26},
number = {1},
pages = {44--62},
year = {1986},
url = {https://doi.org/10.1007/BF01939361},
doi = {10.1007/BF01939361},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Winter86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Yeh86,
author = {D. Yun Yeh},
title = {A Dynamic Programming Approach to the Complete Set Partitioning Problem},
journal = {{BIT}},
volume = {26},
number = {4},
pages = {467--474},
year = {1986},
url = {https://doi.org/10.1007/BF01935053},
doi = {10.1007/BF01935053},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Yeh86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Zhang86,
author = {Yixin Zhang},
title = {A Note on Parallel Depth First Search},
journal = {{BIT}},
volume = {26},
number = {2},
pages = {195--198},
year = {1986},
url = {https://doi.org/10.1007/BF01933745},
doi = {10.1007/BF01933745},
timestamp = {Fri, 09 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Zhang86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ArmenakisGG85,
author = {A. C. Armenakis and
L. E. Garey and
R. D. Gupta},
title = {An Adaption of a Root Finding Method to Searching Ordered Disk Files},
journal = {{BIT}},
volume = {25},
number = {4},
pages = {561--568},
year = {1985},
url = {https://doi.org/10.1007/BF01936136},
doi = {10.1007/BF01936136},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ArmenakisGG85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Arnborg85,
author = {Stefan Arnborg},
title = {Efficient Algorithms for Combinatorial Problems with Bounded Decomposability
- {A} Survey},
journal = {{BIT}},
volume = {25},
number = {1},
pages = {1--23},
year = {1985},
url = {https://doi.org/10.1007/BF01934985},
doi = {10.1007/BF01934985},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Arnborg85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/AugerK85,
author = {Ivan E. Auger and
Mukkai S. Krishnamoorthy},
title = {A Parallel Algorithm for the Monadic Unification Problem},
journal = {{BIT}},
volume = {25},
number = {2},
pages = {302--306},
year = {1985},
url = {https://doi.org/10.1007/BF01934375},
doi = {10.1007/BF01934375},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/AugerK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/BuiT85,
author = {Tien Dai Bui and
Mai Thanh},
title = {Significant Improvements to the Ford-Johnson Algorithm for Sorting},
journal = {{BIT}},
volume = {25},
number = {1},
pages = {70--75},
year = {1985},
url = {https://doi.org/10.1007/BF01934989},
doi = {10.1007/BF01934989},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/BuiT85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ChazelleGL85,
author = {Bernard Chazelle and
Leonidas J. Guibas and
D. T. Lee},
title = {The Power of Geometric Duality},
journal = {{BIT}},
volume = {25},
number = {1},
pages = {76--90},
year = {1985},
url = {https://doi.org/10.1007/BF01934990},
doi = {10.1007/BF01934990},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ChazelleGL85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Daini85,
author = {Ola{-}Olu A. Daini},
title = {A Language-Driven Generalized Numerical Database Translator},
journal = {{BIT}},
volume = {25},
number = {1},
pages = {91--105},
year = {1985},
url = {https://doi.org/10.1007/BF01934991},
doi = {10.1007/BF01934991},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Daini85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/EvansY85,
author = {David J. Evans and
Nadia Y. Yousif},
title = {Analysis of the Performance of the Parallel Quicksort Method},
journal = {{BIT}},
volume = {25},
number = {1},
pages = {106--112},
year = {1985},
url = {https://doi.org/10.1007/BF01934992},
doi = {10.1007/BF01934992},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/EvansY85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/FennerF85,
author = {Trevor I. Fenner and
Alan M. Frieze},
title = {An Algorithm for Finding a Matroid Basis which Maximizes the Products
of the Weights of the Elements},
journal = {{BIT}},
volume = {25},
number = {3},
pages = {433--438},
year = {1985},
url = {https://doi.org/10.1007/BF01935363},
doi = {10.1007/BF01935363},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/FennerF85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Flajolet85,
author = {Philippe Flajolet},
title = {Approximate Counting: {A} Detailed Analysis},
journal = {{BIT}},
volume = {25},
number = {1},
pages = {113--134},
year = {1985},
url = {https://doi.org/10.1007/BF01934993},
doi = {10.1007/BF01934993},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Flajolet85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/FrancisF85,
author = {N. D. Francis and
D. I. Fleming},
title = {Optimum Allocation of Places to Students in a National University
System},
journal = {{BIT}},
volume = {25},
number = {2},
pages = {307--317},
year = {1985},
url = {https://doi.org/10.1007/BF01934376},
doi = {10.1007/BF01934376},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/FrancisF85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Franksen85,
author = {Ole Immanuel Franksen},
title = {The Nature of Data: From Measurements to Systems},
journal = {{BIT}},
volume = {25},
number = {1},
pages = {24--50},
year = {1985},
url = {https://doi.org/10.1007/BF01934986},
doi = {10.1007/BF01934986},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Franksen85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Hinrichs85,
author = {Klaus H. Hinrichs},
title = {Implementation of the Grid File: Design Concepts and Experience},
journal = {{BIT}},
volume = {25},
number = {4},
pages = {569--592},
year = {1985},
url = {https://doi.org/10.1007/BF01936137},
doi = {10.1007/BF01936137},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Hinrichs85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Jakobsson85,
author = {Matti Jakobsson},
title = {Compression of Character Stings by an Adaptive Dictionary},
journal = {{BIT}},
volume = {25},
number = {4},
pages = {593--603},
year = {1985},
url = {https://doi.org/10.1007/BF01936138},
doi = {10.1007/BF01936138},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Jakobsson85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Koskimies85,
author = {Kai Koskimies},
title = {A Note on One-Pass Evaluation of Attribute Grammars},
journal = {{BIT}},
volume = {25},
number = {3},
pages = {439--450},
year = {1985},
url = {https://doi.org/10.1007/BF01935364},
doi = {10.1007/BF01935364},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Koskimies85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Krogdahl85,
author = {Stein Krogdahl},
title = {Multiple Inheritance in SIMULA-like Languages},
journal = {{BIT}},
volume = {25},
number = {2},
pages = {318--326},
year = {1985},
url = {https://doi.org/10.1007/BF01934377},
doi = {10.1007/BF01934377},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Krogdahl85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Makinen85,
author = {Erkki M{\"{a}}kinen},
title = {On Permutative Grammars Generating Context-Free Languages},
journal = {{BIT}},
volume = {25},
number = {4},
pages = {604--610},
year = {1985},
url = {https://doi.org/10.1007/BF01936139},
doi = {10.1007/BF01936139},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Makinen85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/NogaA85,
author = {Mark T. Noga and
Donald C. S. Allison},
title = {Sorting in Linear Expected Time},
journal = {{BIT}},
volume = {25},
number = {3},
pages = {451--465},
year = {1985},
url = {https://doi.org/10.1007/BF01935365},
doi = {10.1007/BF01935365},
timestamp = {Sat, 13 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/NogaA85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Nossum85,
author = {Rolf Nossum},
title = {Automated Theorem Proving Methods},
journal = {{BIT}},
volume = {25},
number = {1},
pages = {51--64},
year = {1985},
url = {https://doi.org/10.1007/BF01934987},
doi = {10.1007/BF01934987},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Nossum85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Nurmi85,
author = {Otto Nurmi},
title = {A Fast Line-Sweep Algorithm for Hidden Line Elimination},
journal = {{BIT}},
volume = {25},
number = {3},
pages = {466--472},
year = {1985},
url = {https://doi.org/10.1007/BF01935366},
doi = {10.1007/BF01935366},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Nurmi85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/PenttonenK85,
author = {Martti Penttonen and
Jyrki Katajainen},
title = {Notes on the Complexity of Sorting in Abstract Machines},
journal = {{BIT}},
volume = {25},
number = {4},
pages = {611--622},
year = {1985},
url = {https://doi.org/10.1007/BF01936140},
doi = {10.1007/BF01936140},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/PenttonenK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Pettorossi85,
author = {Alberto Pettorossi},
title = {Towers of Hanoi Problems: Deriving Iterative Solutions by Program
Transformations},
journal = {{BIT}},
volume = {25},
number = {2},
pages = {327--334},
year = {1985},
url = {https://doi.org/10.1007/BF01934378},
doi = {10.1007/BF01934378},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Pettorossi85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Quinn85,
author = {Michael J. Quinn},
title = {A Note on Two Parallel Algorithms to Solve the Stable Marriage Problem},
journal = {{BIT}},
volume = {25},
number = {3},
pages = {473--476},
year = {1985},
url = {https://doi.org/10.1007/BF01935367},
doi = {10.1007/BF01935367},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Quinn85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/RamamohanaraoS85,
author = {Kotagiri Ramamohanarao and
Ron Sacks{-}Davis},
title = {Partial Match Retrieval Using Recursive Linear Hashing},
journal = {{BIT}},
volume = {25},
number = {3},
pages = {477--484},
year = {1985},
url = {https://doi.org/10.1007/BF01935368},
doi = {10.1007/BF01935368},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/RamamohanaraoS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Regnier85,
author = {Mireille R{\'{e}}gnier},
title = {Analysis of Grid File Algorithms},
journal = {{BIT}},
volume = {25},
number = {2},
pages = {335--357},
year = {1985},
url = {https://doi.org/10.1007/BF01934379},
doi = {10.1007/BF01934379},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Regnier85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Tamminen85,
author = {Markku Tamminen},
title = {On Search by Address Computation},
journal = {{BIT}},
volume = {25},
number = {1},
pages = {135--147},
year = {1985},
url = {https://doi.org/10.1007/BF01934994},
doi = {10.1007/BF01934994},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Tamminen85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Thorelli85,
author = {Lars{-}Erik Thorelli},
title = {A Language for Linking Modules into Systems},
journal = {{BIT}},
volume = {25},
number = {2},
pages = {358--378},
year = {1985},
url = {https://doi.org/10.1007/BF01934380},
doi = {10.1007/BF01934380},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Thorelli85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Tienari85,
author = {Martti Tienari},
title = {Computer Networking of Nordic Universities},
journal = {{BIT}},
volume = {25},
number = {1},
pages = {65--69},
year = {1985},
url = {https://doi.org/10.1007/BF01934988},
doi = {10.1007/BF01934988},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Tienari85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Winter85,
author = {Pawel Winter},
title = {Generalized Steiner Problems in Outerplanar Networks},
journal = {{BIT}},
volume = {25},
number = {3},
pages = {485--496},
year = {1985},
url = {https://doi.org/10.1007/BF01935369},
doi = {10.1007/BF01935369},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Winter85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/YangD85,
author = {Wei{-}Pang Yang and
M. W. Du},
title = {A Backtracking Method for Constructing Perfect Hash Functions from
a Set of Mapping Functions},
journal = {{BIT}},
volume = {25},
number = {1},
pages = {148--164},
year = {1985},
url = {https://doi.org/10.1007/BF01934995},
doi = {10.1007/BF01934995},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/YangD85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/AllisonN84,
author = {Donald C. S. Allison and
Mark T. Noga},
title = {Some Performance Tests of Convex Hull Algorithms},
journal = {{BIT}},
volume = {24},
number = {1},
pages = {2--13},
year = {1984},
url = {https://doi.org/10.1007/BF01934510},
doi = {10.1007/BF01934510},
timestamp = {Sat, 13 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/AllisonN84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Carlsson84,
author = {Svante Carlsson},
title = {Improving Worst-Case Behavior of Heaps},
journal = {{BIT}},
volume = {24},
number = {1},
pages = {14--18},
year = {1984},
url = {https://doi.org/10.1007/BF01934511},
doi = {10.1007/BF01934511},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Carlsson84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Chan84,
author = {Mee Yee Chan},
title = {Multidisk File Design: An Analysis of Folding Buckets to Disks},
journal = {{BIT}},
volume = {24},
number = {3},
pages = {261--268},
year = {1984},
url = {https://doi.org/10.1007/BF02136024},
doi = {10.1007/BF02136024},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Chan84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ChangL84,
author = {R. C. Chang and
Richard C. T. Lee},
title = {On the Average Length of Delaunay Triangulations},
journal = {{BIT}},
volume = {24},
number = {3},
pages = {269--273},
year = {1984},
url = {https://doi.org/10.1007/BF02136025},
doi = {10.1007/BF02136025},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ChangL84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ErnvallN84,
author = {Jarmo Ernvall and
Olli Nevalainen},
title = {Estimating the Length of Minimal Spanning Trees in Compression of
Files},
journal = {{BIT}},
volume = {24},
number = {1},
pages = {19--32},
year = {1984},
url = {https://doi.org/10.1007/BF01934512},
doi = {10.1007/BF01934512},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ErnvallN84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/FennerL84,
author = {Trevor I. Fenner and
George Loizou},
title = {Loop-Free Algorithms for Traversing Binary Trees},
journal = {{BIT}},
volume = {24},
number = {1},
pages = {33--44},
year = {1984},
url = {https://doi.org/10.1007/BF01934513},
doi = {10.1007/BF01934513},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/FennerL84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/GhoshB84,
author = {Ratan K. Ghosh and
G. P. Bhattacharjee},
title = {A Parallel Search Algorithm for Directed Acyclic Graphs},
journal = {{BIT}},
volume = {24},
number = {2},
pages = {133--150},
year = {1984},
url = {https://doi.org/10.1007/BF01937481},
doi = {10.1007/BF01937481},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/GhoshB84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/GuptaB84,
author = {P. Gupta and
G. P. Bhattacharjee},
title = {A Parallel Selection Algorithm},
journal = {{BIT}},
volume = {24},
number = {3},
pages = {274--287},
year = {1984},
url = {https://doi.org/10.1007/BF02136026},
doi = {10.1007/BF02136026},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/GuptaB84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/HsuD84,
author = {W. J. Hsu and
M. W. Du},
title = {Computing a Longest Common Subsequence for a Set of Strings},
journal = {{BIT}},
volume = {24},
number = {1},
pages = {45--59},
year = {1984},
url = {https://doi.org/10.1007/BF01934514},
doi = {10.1007/BF01934514},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/HsuD84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Makinen84,
author = {Erkki M{\"{a}}kinen},
title = {On Context-Free and Szilard Languages},
journal = {{BIT}},
volume = {24},
number = {2},
pages = {164--170},
year = {1984},
url = {https://doi.org/10.1007/BF01937483},
doi = {10.1007/BF01937483},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Makinen84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/MalmquistR84,
author = {Johann P. Malmquist and
Edward L. Robertson},
title = {On the Complexity of Partitioning Sparse Matrix Representations},
journal = {{BIT}},
volume = {24},
number = {1},
pages = {60--68},
year = {1984},
url = {https://doi.org/10.1007/BF01934515},
doi = {10.1007/BF01934515},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/MalmquistR84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Maus84,
author = {Arne Maus},
title = {Delaunay Triangulation and the Convex Hull of \emph{n} Points in Expected
Linear Time},
journal = {{BIT}},
volume = {24},
number = {2},
pages = {151--163},
year = {1984},
url = {https://doi.org/10.1007/BF01937482},
doi = {10.1007/BF01937482},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Maus84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Niemi84,
author = {Timo Niemi},
title = {Specification of a Query Language by the Attribute Method},
journal = {{BIT}},
volume = {24},
number = {2},
pages = {171--186},
year = {1984},
url = {https://doi.org/10.1007/BF01937484},
doi = {10.1007/BF01937484},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Niemi84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/NordstromS84,
author = {Bengt Nordstr{\"{o}}m and
Jan M. Smith},
title = {Propositions and Specifications of Programs in Martin-L{\"{o}}fs
Type Theory},
journal = {{BIT}},
volume = {24},
number = {3},
pages = {288--301},
year = {1984},
url = {https://doi.org/10.1007/BF02136027},
doi = {10.1007/BF02136027},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/NordstromS84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/PrabhuD84,
author = {G. M. Prabhu and
Narsingh Deo},
title = {On the Power of a Perturbation for Testing Non-Isomorphism of Graphs},
journal = {{BIT}},
volume = {24},
number = {3},
pages = {302--307},
year = {1984},
url = {https://doi.org/10.1007/BF02136028},
doi = {10.1007/BF02136028},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/PrabhuD84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Torn84,
author = {Aimo A. T{\"{o}}rn},
title = {Hashing with Overflow Indexing},
journal = {{BIT}},
volume = {24},
number = {3},
pages = {317--332},
year = {1984},
url = {https://doi.org/10.1007/BF02136030},
doi = {10.1007/BF02136030},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Torn84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/TsengL84,
author = {S. S. Tseng and
Richard C. T. Lee},
title = {A New Parallel Sorting Algorithm Based Upon Min-Mid-Max Operations},
journal = {{BIT}},
volume = {24},
number = {2},
pages = {187--195},
year = {1984},
url = {https://doi.org/10.1007/BF01937485},
doi = {10.1007/BF01937485},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/TsengL84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/TsengL84a,
author = {S. S. Tseng and
Richard C. T. Lee},
title = {A Parallel Algorithm to Solve the Stable Marriage Problem},
journal = {{BIT}},
volume = {24},
number = {3},
pages = {308--316},
year = {1984},
url = {https://doi.org/10.1007/BF02136029},
doi = {10.1007/BF02136029},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/TsengL84a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/YehL84,
author = {Der{-}Yun Yeh and
D. T. Lee},
title = {Graph Algorithms on a Tree-Structured Parallel Computer},
journal = {{BIT}},
volume = {24},
number = {3},
pages = {333--340},
year = {1984},
url = {https://doi.org/10.1007/BF02136031},
doi = {10.1007/BF02136031},
timestamp = {Fri, 06 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/YehL84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Zaks84,
author = {Shmuel Zaks},
title = {A New Algorithm for Generation of Permutations},
journal = {{BIT}},
volume = {24},
number = {2},
pages = {196--204},
year = {1984},
url = {https://doi.org/10.1007/BF01937486},
doi = {10.1007/BF01937486},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Zaks84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/AlagarBT83,
author = {Vangalur S. Alagar and
Tien Dai Bui and
Mai Thanh},
title = {Efficient Algorithms for Merging},
journal = {{BIT}},
volume = {23},
number = {4},
pages = {409--428},
year = {1983},
url = {https://doi.org/10.1007/BF01933617},
doi = {10.1007/BF01933617},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/AlagarBT83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Burkhard83,
author = {Walter A. Burkhard},
title = {Interpolation-Based Index Maintenance},
journal = {{BIT}},
volume = {23},
number = {3},
pages = {274--294},
year = {1983},
url = {https://doi.org/10.1007/BF01934457},
doi = {10.1007/BF01934457},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Burkhard83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Er83,
author = {M. C. Er},
title = {An Iterative Solution to the Generalized Towers of Hanoi Problem},
journal = {{BIT}},
volume = {23},
number = {3},
pages = {295--302},
year = {1983},
url = {https://doi.org/10.1007/BF01934458},
doi = {10.1007/BF01934458},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Er83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Er83a,
author = {M. C. Er},
title = {An Analysis of the Generalized Towers of Hanoi Problem},
journal = {{BIT}},
volume = {23},
number = {4},
pages = {429--435},
year = {1983},
url = {https://doi.org/10.1007/BF01933618},
doi = {10.1007/BF01933618},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Er83a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/HuangW83,
author = {Shou{-}Hsuan Stephen Huang and
C. K. Wong},
title = {Binary Search Trees with Limited Rotation},
journal = {{BIT}},
volume = {23},
number = {4},
pages = {436--455},
year = {1983},
url = {https://doi.org/10.1007/BF01933619},
doi = {10.1007/BF01933619},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/HuangW83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Itoga83,
author = {Stephen Y. Itoga},
title = {A Probabilistic Version of the Stable Marriage Problem},
journal = {{BIT}},
volume = {23},
number = {2},
pages = {161--169},
year = {1983},
url = {https://doi.org/10.1007/BF02218437},
doi = {10.1007/BF02218437},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Itoga83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/JohansenG83,
author = {Gunner Helweg Johansen and
Chr. Gram},
title = {A Simple Algorithm for Building the 3-D Convex Hull},
journal = {{BIT}},
volume = {23},
number = {2},
pages = {145--160},
year = {1983},
url = {https://doi.org/10.1007/BF02218436},
doi = {10.1007/BF02218436},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/JohansenG83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Katajainen83,
author = {Jyrki Katajainen},
title = {On the Worst Case of a Minimal Spanning Tree Algorithm for Euclidean
Space},
journal = {{BIT}},
volume = {23},
number = {1},
pages = {1--8},
year = {1983},
url = {https://doi.org/10.1007/BF01937321},
doi = {10.1007/BF01937321},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Katajainen83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/KornerupG83,
author = {Peter Kornerup and
R. T. Gregory},
title = {Mapping Integers and Hensel Codes onto Farey Fractions},
journal = {{BIT}},
volume = {23},
number = {1},
pages = {9--20},
year = {1983},
url = {https://doi.org/10.1007/BF01937322},
doi = {10.1007/BF01937322},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/KornerupG83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Larsen83,
author = {Henrik Legind Larsen},
title = {Generalized Double Modulo 11 Check Digit Error Detection},
journal = {{BIT}},
volume = {23},
number = {3},
pages = {303--307},
year = {1983},
url = {https://doi.org/10.1007/BF01934459},
doi = {10.1007/BF01934459},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Larsen83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/NichollLLW83,
author = {Tina M. Nicholl and
D. T. Lee and
Yuh{-}Zen Liao and
Chak{-}Kuen Wong},
title = {On the {X-Y} Convex Hull of a Set of {X-Y} Polygons},
journal = {{BIT}},
volume = {23},
number = {4},
pages = {456--471},
year = {1983},
url = {https://doi.org/10.1007/BF01933620},
doi = {10.1007/BF01933620},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/NichollLLW83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/OrensteinMD83,
author = {Jack A. Orenstein and
T. H. Merrett and
Luc Devroye},
title = {Linear Sorting with O(log n) Processors},
journal = {{BIT}},
volume = {23},
number = {2},
pages = {170--180},
year = {1983},
url = {https://doi.org/10.1007/BF02218438},
doi = {10.1007/BF02218438},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/OrensteinMD83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/RamanI83,
author = {Vasudevan Raman and
S. Sitharama Iyengar},
title = {Properties and Applications of Forests of Quadtrees},
journal = {{BIT}},
volume = {23},
number = {4},
pages = {472--486},
year = {1983},
url = {https://doi.org/10.1007/BF01933621},
doi = {10.1007/BF01933621},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/RamanI83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Turini83,
author = {Franco Turini},
title = {Abstractions of Control Environments},
journal = {{BIT}},
volume = {23},
number = {1},
pages = {21--35},
year = {1983},
url = {https://doi.org/10.1007/BF01937323},
doi = {10.1007/BF01937323},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Turini83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Ukkonen83,
author = {Esko Ukkonen},
title = {Exponential Lower Bounds for Some NP-Complete Problems in a Restricted
Linear Decision Tree Model},
journal = {{BIT}},
volume = {23},
number = {2},
pages = {181--192},
year = {1983},
url = {https://doi.org/10.1007/BF02218439},
doi = {10.1007/BF02218439},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Ukkonen83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Yeh83,
author = {Dashing Yeh},
title = {On Incremental Shift-Reduce Parsing},
journal = {{BIT}},
volume = {23},
number = {1},
pages = {36--48},
year = {1983},
url = {https://doi.org/10.1007/BF01937324},
doi = {10.1007/BF01937324},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Yeh83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Yeh83a,
author = {Dashing Yeh},
title = {On Incremental Evaluation of Ordered Attribute Grammars},
journal = {{BIT}},
volume = {23},
number = {3},
pages = {308--320},
year = {1983},
url = {https://doi.org/10.1007/BF01934460},
doi = {10.1007/BF01934460},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Yeh83a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Akl82,
author = {Selim G. Akl},
title = {A Constant-Time Parallel Algorithm for Computing Convex Hulls},
journal = {{BIT}},
volume = {22},
number = {2},
pages = {129--134},
year = {1982},
url = {https://doi.org/10.1007/BF01944471},
doi = {10.1007/BF01944471},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Akl82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/AllisonN82,
author = {Donald C. S. Allison and
Mark T. Noga},
title = {{USORT:} An Efficient Hybrid of Distributed Partitioning Sorting},
journal = {{BIT}},
volume = {22},
number = {2},
pages = {135--139},
year = {1982},
url = {https://doi.org/10.1007/BF01944472},
doi = {10.1007/BF01944472},
timestamp = {Sat, 13 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/AllisonN82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/EdelsbrunnerMPRWW82,
author = {Herbert Edelsbrunner and
Hermann A. Maurer and
Franco P. Preparata and
Arnold L. Rosenberg and
Emo Welzl and
Derick Wood},
title = {Stabbing Line Segments},
journal = {{BIT}},
volume = {22},
number = {3},
pages = {274--281},
year = {1982},
url = {https://doi.org/10.1007/BF01934440},
doi = {10.1007/BF01934440},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/EdelsbrunnerMPRWW82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Gunderson82,
author = {Robert W. Gunderson},
title = {Choosing the r-Dimension for the {FCV} Family of Clustering Algorithms},
journal = {{BIT}},
volume = {22},
number = {2},
pages = {140--149},
year = {1982},
url = {https://doi.org/10.1007/BF01944473},
doi = {10.1007/BF01944473},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Gunderson82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Kirkerud82,
author = {Bj{\o}rn Kirkerud},
title = {Completeness of Hoare-Calculi Revisited},
journal = {{BIT}},
volume = {22},
number = {4},
pages = {401--418},
year = {1982},
url = {https://doi.org/10.1007/BF01934406},
doi = {10.1007/BF01934406},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Kirkerud82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Langston82,
author = {Michael A. Langston},
title = {Improved 0/1-Interchange Scheduling},
journal = {{BIT}},
volume = {22},
number = {3},
pages = {282--290},
year = {1982},
url = {https://doi.org/10.1007/BF01934441},
doi = {10.1007/BF01934441},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Langston82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/LloydR82,
author = {John W. Lloyd and
Kotagiri Ramamohanarao},
title = {Partial Match Retrieval for Dynamic Files},
journal = {{BIT}},
volume = {22},
number = {2},
pages = {150--168},
year = {1982},
url = {https://doi.org/10.1007/BF01944474},
doi = {10.1007/BF01944474},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/LloydR82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/LofgrenM82,
author = {Mats L{\"{o}}fgren and
Boris Magnusson},
title = {Access Mechanisms in Block Structured Environments},
journal = {{BIT}},
volume = {22},
number = {4},
pages = {419--436},
year = {1982},
url = {https://doi.org/10.1007/BF01934407},
doi = {10.1007/BF01934407},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/LofgrenM82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Lundberg82,
author = {Bengt G. Lundberg},
title = {An Axiomatization of Events},
journal = {{BIT}},
volume = {22},
number = {3},
pages = {291--299},
year = {1982},
url = {https://doi.org/10.1007/BF01934442},
doi = {10.1007/BF01934442},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Lundberg82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Naur82,
author = {Peter Naur},
title = {Formalization in Program Development},
journal = {{BIT}},
volume = {22},
number = {4},
pages = {437--453},
year = {1982},
url = {https://doi.org/10.1007/BF01934408},
doi = {10.1007/BF01934408},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Naur82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Navlakha82,
author = {Jainendra K. Navlakha},
title = {A New Proof Technique to Establish Equivalence of the Original and
the General Lambda-Free {CFG} with Linear Increase in Size},
journal = {{BIT}},
volume = {22},
number = {1},
pages = {17--26},
year = {1982},
url = {https://doi.org/10.1007/BF01934392},
doi = {10.1007/BF01934392},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Navlakha82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Perko82,
author = {Arni Perko},
title = {On the Path Representation of Networks},
journal = {{BIT}},
volume = {22},
number = {3},
pages = {300--302},
year = {1982},
url = {https://doi.org/10.1007/BF01934443},
doi = {10.1007/BF01934443},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Perko82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Soffa82,
author = {Mary Lou Soffa},
title = {Control Discipline Necessity: Making the Language as General as the
Implementation},
journal = {{BIT}},
volume = {22},
number = {2},
pages = {169--182},
year = {1982},
url = {https://doi.org/10.1007/BF01944475},
doi = {10.1007/BF01944475},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Soffa82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Soisalon-Soininen82,
author = {Eljas Soisalon{-}Soininen},
title = {Translations on a Subclass of LR(k) Grammars},
journal = {{BIT}},
volume = {22},
number = {3},
pages = {303--312},
year = {1982},
url = {https://doi.org/10.1007/BF01934444},
doi = {10.1007/BF01934444},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Soisalon-Soininen82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Tamminen82,
author = {Markku Tamminen},
title = {The Extendible Cell Method for Closest Point Problems},
journal = {{BIT}},
volume = {22},
number = {1},
pages = {27--41},
year = {1982},
url = {https://doi.org/10.1007/BF01934393},
doi = {10.1007/BF01934393},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Tamminen82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ThanhB82,
author = {Mai Thanh and
Tien Dai Bui},
title = {An Improvement of the Binary Merge Algorithm},
journal = {{BIT}},
volume = {22},
number = {4},
pages = {454--462},
year = {1982},
url = {https://doi.org/10.1007/BF01934409},
doi = {10.1007/BF01934409},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ThanhB82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Topor82,
author = {Rodney W. Topor},
title = {Fundamental Solutions of the Eight Queens Problem},
journal = {{BIT}},
volume = {22},
number = {1},
pages = {42--52},
year = {1982},
url = {https://doi.org/10.1007/BF01934394},
doi = {10.1007/BF01934394},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Topor82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Yeh82,
author = {Dashing Yeh},
title = {Improved Planarity Algorithms},
journal = {{BIT}},
volume = {22},
number = {1},
pages = {2--16},
year = {1982},
url = {https://doi.org/10.1007/BF01934391},
doi = {10.1007/BF01934391},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Yeh82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/BrockBS81,
author = {Harvey K. Brock and
Barbara J. Brooks and
Francis Sullivan},
title = {Diamond - {A} Sorting Method for Vector Machines},
journal = {{BIT}},
volume = {21},
number = {2},
pages = {142--152},
year = {1981},
url = {https://doi.org/10.1007/BF01933158},
doi = {10.1007/BF01933158},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/BrockBS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/DarondeauGR81,
author = {Philippe Darondeau and
Paul {Le Guernic} and
Michel Raynal},
title = {Types in a Mixed Language System},
journal = {{BIT}},
volume = {21},
number = {3},
pages = {245--254},
year = {1981},
url = {https://doi.org/10.1007/BF01941461},
doi = {10.1007/BF01941461},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/DarondeauGR81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Doberkat81,
author = {Ernst{-}Erich Doberkat},
title = {Inserting a New Element in a Heap},
journal = {{BIT}},
volume = {21},
number = {3},
pages = {255--269},
year = {1981},
url = {https://doi.org/10.1007/BF01941462},
doi = {10.1007/BF01941462},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Doberkat81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Erkio81,
author = {Hannu Erki{\"{o}}},
title = {Speeding Sort Algorithms by Special Instructions},
journal = {{BIT}},
volume = {21},
number = {1},
pages = {2--19},
year = {1981},
url = {https://doi.org/10.1007/BF01934066},
doi = {10.1007/BF01934066},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Erkio81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/FennerL81,
author = {Trevor I. Fenner and
George Loizou},
title = {A Note on Traversal Algorithms for Triply Linked Binary Trees},
journal = {{BIT}},
volume = {21},
number = {2},
pages = {153--156},
year = {1981},
url = {https://doi.org/10.1007/BF01933159},
doi = {10.1007/BF01933159},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/FennerL81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Itoga81,
author = {Stephen Y. Itoga},
title = {The String Merging Problem},
journal = {{BIT}},
volume = {21},
number = {1},
pages = {20--30},
year = {1981},
url = {https://doi.org/10.1007/BF01934067},
doi = {10.1007/BF01934067},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Itoga81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Knuth81,
author = {Donald E. Knuth},
title = {Verification of Link-Level Protocols},
journal = {{BIT}},
volume = {21},
number = {1},
pages = {31--36},
year = {1981},
url = {https://doi.org/10.1007/BF01934068},
doi = {10.1007/BF01934068},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Knuth81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/KristensenM81,
author = {Bent Bruun Kristensen and
Ole Lehrmann Madsen},
title = {Diagnostics on LALR(k) Conflicts Based on a Method for LR(k) Testing},
journal = {{BIT}},
volume = {21},
number = {3},
pages = {270--293},
year = {1981},
url = {https://doi.org/10.1007/BF01941463},
doi = {10.1007/BF01941463},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bit/KristensenM81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/LamF81,
author = {C. M. Lam and
K. T. Fung},
title = {A Quadratic Programming Model for Optimal Data Distribution},
journal = {{BIT}},
volume = {21},
number = {3},
pages = {294--304},
year = {1981},
url = {https://doi.org/10.1007/BF01941464},
doi = {10.1007/BF01941464},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/LamF81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Lundberg81,
author = {Bengt G. Lundberg},
title = {On Consistency of Information Models},
journal = {{BIT}},
volume = {21},
number = {1},
pages = {37--45},
year = {1981},
url = {https://doi.org/10.1007/BF01934069},
doi = {10.1007/BF01934069},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Lundberg81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Mullin81,
author = {James K. Mullin},
title = {Tightly Controlled Linear Hashing without Separate Overflow Storage},
journal = {{BIT}},
volume = {21},
number = {4},
pages = {390--400},
year = {1981},
url = {https://doi.org/10.1007/BF01932837},
doi = {10.1007/BF01932837},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Mullin81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/NevalainenEK81,
author = {Olli Nevalainen and
Jarmo Ernvall and
Jyrki Katajainen},
title = {Finding Minimal Spanning Trees in a Euclidean Coordinate Space},
journal = {{BIT}},
volume = {21},
number = {1},
pages = {46--54},
year = {1981},
url = {https://doi.org/10.1007/BF01934070},
doi = {10.1007/BF01934070},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/NevalainenEK81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/OukselS81,
author = {Aris M. Ouksel and
Peter Scheuermann},
title = {Multidimensional B-Trees: Analysis of Dynamic Behavior},
journal = {{BIT}},
volume = {21},
number = {4},
pages = {401--418},
year = {1981},
url = {https://doi.org/10.1007/BF01932838},
doi = {10.1007/BF01932838},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/OukselS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Sprugnoli81,
author = {Renzo Sprugnoli},
title = {On the Allocation of Binary Trees to Secondary Storage},
journal = {{BIT}},
volume = {21},
number = {3},
pages = {305--316},
year = {1981},
url = {https://doi.org/10.1007/BF01941465},
doi = {10.1007/BF01941465},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Sprugnoli81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Tamminen81,
author = {Markku Tamminen},
title = {Order Preserving Extendible Hashing and Bucket Tries},
journal = {{BIT}},
volume = {21},
number = {4},
pages = {419--435},
year = {1981},
url = {https://doi.org/10.1007/BF01932839},
doi = {10.1007/BF01932839},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Tamminen81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Wallis81,
author = {Peter J. L. Wallis},
title = {Some Primitives for the Portable Programming of Arrays and Vector
Processors},
journal = {{BIT}},
volume = {21},
number = {4},
pages = {436--448},
year = {1981},
url = {https://doi.org/10.1007/BF01932840},
doi = {10.1007/BF01932840},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Wallis81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Wong81,
author = {Jin Kiu Wong},
title = {Some Simple In-Place Merging Algorithms},
journal = {{BIT}},
volume = {21},
number = {2},
pages = {157--166},
year = {1981},
url = {https://doi.org/10.1007/BF01933160},
doi = {10.1007/BF01933160},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Wong81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Akl80,
author = {Selim G. Akl},
title = {A New Algorithm for Generating Derangements},
journal = {{BIT}},
volume = {20},
number = {1},
pages = {2--7},
year = {1980},
url = {https://doi.org/10.1007/BF01933579},
doi = {10.1007/BF01933579},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Akl80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Arnborg80,
author = {Stefan Arnborg},
title = {A Simple Query Language Based on Set Algebra},
journal = {{BIT}},
volume = {20},
number = {3},
pages = {265--278},
year = {1980},
url = {https://doi.org/10.1007/BF01932769},
doi = {10.1007/BF01932769},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Arnborg80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/ChanG80,
author = {W. M. Chan and
Alan George},
title = {A Linear Time Implementation of the Reverse Cuthill-McKee Algorithm},
journal = {{BIT}},
volume = {20},
number = {1},
pages = {8--14},
year = {1980},
url = {https://doi.org/10.1007/BF01933580},
doi = {10.1007/BF01933580},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/ChanG80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Davies80,
author = {D. Julian M. Davies},
title = {The Fifty Percent Rule Revisited},
journal = {{BIT}},
volume = {20},
number = {3},
pages = {279--288},
year = {1980},
url = {https://doi.org/10.1007/BF01932770},
doi = {10.1007/BF01932770},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Davies80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Erkio80,
author = {Hannu Erki{\"{o}}},
title = {A Heuristic Approximation of the Worst Case of Shellsort},
journal = {{BIT}},
volume = {20},
number = {2},
pages = {130--136},
year = {1980},
url = {https://doi.org/10.1007/BF01933185},
doi = {10.1007/BF01933185},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Erkio80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Gjessing80,
author = {Stein Gjessing},
title = {Monitors with Arrays of Condition Variables and Proof Rules Handling
Local Quantities},
journal = {{BIT}},
volume = {20},
number = {2},
pages = {137--144},
year = {1980},
url = {https://doi.org/10.1007/BF01933186},
doi = {10.1007/BF01933186},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Gjessing80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/HakolaH80,
author = {Juha Hakola and
Ari Heiskanen},
title = {On the Distribution of Wasted Space at the End of File Blocks},
journal = {{BIT}},
volume = {20},
number = {2},
pages = {145--156},
year = {1980},
url = {https://doi.org/10.1007/BF01933187},
doi = {10.1007/BF01933187},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/HakolaH80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Hemker80,
author = {Pieter W. Hemker},
title = {On the Structure of an Adaptive Multi-Level Algorithm},
journal = {{BIT}},
volume = {20},
number = {3},
pages = {289--301},
year = {1980},
url = {https://doi.org/10.1007/BF01932771},
doi = {10.1007/BF01932771},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Hemker80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Jarvinen80,
author = {Pertti J{\"{a}}rvinen},
title = {On Structuring Problems of Job Design Met in the Development and Maintenance
of Information Systems},
journal = {{BIT}},
volume = {20},
number = {1},
pages = {15--24},
year = {1980},
url = {https://doi.org/10.1007/BF01933581},
doi = {10.1007/BF01933581},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Jarvinen80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Jorgensen80,
author = {Anker Helms J{\o}rgensen},
title = {A Methodology for Measuring the Readability and Modifiability of Computer
Programs},
journal = {{BIT}},
volume = {20},
number = {4},
pages = {393--405},
year = {1980},
url = {https://doi.org/10.1007/BF01933633},
doi = {10.1007/BF01933633},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Jorgensen80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Kemp80,
author = {Rainer Kemp},
title = {A Note on the Stack Size of Regularly Distributed Binary Trees},
journal = {{BIT}},
volume = {20},
number = {2},
pages = {157--162},
year = {1980},
url = {https://doi.org/10.1007/BF01933188},
doi = {10.1007/BF01933188},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Kemp80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Larson80,
author = {Per{-}{\AA}ke Larson},
title = {Analysis of Repeated Hashing},
journal = {{BIT}},
volume = {20},
number = {1},
pages = {25--32},
year = {1980},
url = {https://doi.org/10.1007/BF01933582},
doi = {10.1007/BF01933582},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Larson80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Lloyd80,
author = {John W. Lloyd},
title = {Optimal Partial-Match Retrieval},
journal = {{BIT}},
volume = {20},
number = {4},
pages = {406--413},
year = {1980},
url = {https://doi.org/10.1007/BF01933634},
doi = {10.1007/BF01933634},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Lloyd80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Naur80,
author = {Peter Naur},
title = {Impressions of the Early Days of Programming},
journal = {{BIT}},
volume = {20},
number = {4},
pages = {414--425},
year = {1980},
url = {https://doi.org/10.1007/BF01933635},
doi = {10.1007/BF01933635},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Naur80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/OttmannS80,
author = {Thomas Ottmann and
Wolffried Stucky},
title = {Higher Order Analysis of Random 1-2 Brother Trees},
journal = {{BIT}},
volume = {20},
number = {3},
pages = {302--314},
year = {1980},
url = {https://doi.org/10.1007/BF01932772},
doi = {10.1007/BF01932772},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/OttmannS80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/SixW80,
author = {Hans{-}Werner Six and
Derick Wood},
title = {The Rectangle Intersection Problem Revisited},
journal = {{BIT}},
volume = {20},
number = {4},
pages = {426--433},
year = {1980},
url = {https://doi.org/10.1007/BF01933636},
doi = {10.1007/BF01933636},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/SixW80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/StrombergF80,
author = {Dan Str{\"{o}}mberg and
Peter Fritzson},
title = {Transfer of Programs from Development to Runtime Environments},
journal = {{BIT}},
volume = {20},
number = {4},
pages = {434--442},
year = {1980},
url = {https://doi.org/10.1007/BF01933637},
doi = {10.1007/BF01933637},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/StrombergF80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Wilander80,
author = {Jerker Wilander},
title = {An Interactive Programming System for Pascal},
journal = {{BIT}},
volume = {20},
number = {2},
pages = {163--174},
year = {1980},
url = {https://doi.org/10.1007/BF01933189},
doi = {10.1007/BF01933189},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bit/Wilander80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Larson78,
author = {Per{-}{\AA}ke Larson},
title = {Dynamic Hashing},
journal = {{BIT}},
volume = {18},
number = {2},
pages = {184--201},
year = {1978},
timestamp = {Thu, 03 Jan 2002 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bit/Larson78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Tarnlund77,
author = {Sten{-}{\AA}ke T{\"{a}}rnlund},
title = {Horn Clause Computability},
journal = {{BIT}},
volume = {17},
number = {2},
pages = {215--226},
year = {1977},
timestamp = {Thu, 03 Jan 2002 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bit/Tarnlund77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bit/Purdom70,
author = {Paul Walton Purdom Jr.},
title = {A Transitive Closure Algorithm},
journal = {{BIT}},
volume = {10},
pages = {76--94},
year = {1970},
timestamp = {Thu, 03 Jan 2002 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bit/Purdom70.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-25 16:13 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:
