Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/bit/bit24.bht:"
download as .bib file
@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}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-07-26 10:06 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:
