Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Majewski, Bohdan S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Perfect hashing
Zbigniew J. Czech
,
George Havas
,
Bohdan S. Majewski
Theoretical Computer Science
182
(1-2), 1997, pp. 1-143
Integer matrix diagonalization
George Havas
,
Bohdan S. Majewski
Journal Symbolic Computation
24
(3-4), 1997, pp. 399-408
A solution to the extended gcd problem
Bohdan S. Majewski
,
George Havas
Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, ISSAC'95 (Montreal, Canada, July 10-12, 1995)
, 1995, pp. 248-253
The complexity of greatest common divisor computations
Bohdan S. Majewski
,
George Havas
Proceedings of the 1st International Symposium, ANTS-I. Algorithmic Number Theory (Ithaca, NY, USA, May 6-9, 1994)
LNCS 877
, 1994, pp. 184-193
Parallel algorithms for finding a suboptimal fundamental-cycle set in a graph
Zbigniew J. Czech
,
Marek Konopka
,
Bohdan S. Majewski
Parallel Computing
19
(9), 1993, pp. 961-971
Graphs, hypergraphs and hashing
George Havas
,
Bohdan S. Majewski
,
Nicholas C. Wormald
,
Zbigniew J. Czech
Lecture Notes in Computer Science
790
, 1993, pp. 153-165
An optimal algorithm for generating minimal perfect hash functions
Zbigniew J. Czech
,
George Havas
,
Bohdan S. Majewski
Information Processing Letters
43
, 1992, pp. 257-264