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
[1]
Hilfe
Suche: Journal=Combinatorica AND Volume=7
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Large holes in sparse random graphs
A.M. Frieze
,
B. Jackson
Combinatorica
7
(3), 1987, pp. 265-274
Expose-and-merge exploration and the chromatic number of random graphs
D.W. Matula
Combinatorica
7
(3), 1987, pp. 275-284
A problem of Erdŏs on Abelian groups
J.E. Olson
Combinatorica
7
(3), 1987, pp. 285-290
Quasi-symmetric 2, 3, 4-designs
S.S. Sane
,
M.S. Shrikhande
Combinatorica
7
(3), 1987, pp. 291-302
Subgraphs of colour-critical graphs
M. Stiebitz
Combinatorica
7
(3), 1987, pp. 303-312
A parallel algorithm for the maximal path problem
R. Anderson
Combinatorica
7
(4), 1987, pp. 315-326
An algorithm for finding Hamilton cycles in a random graph
B. Bollobás
,
T.I. Fenner
,
A.M. Frieze
Combinatorica
7
(4), 1987, pp. 327-342
Expanders obtained from affine transformations
S. Jimbo
,
A. Maruoka
Combinatorica
7
(4), 1987, pp. 343-356
One-way functions and pseudorandom generators
L.A. Levin
Combinatorica
7
(4), 1987, pp. 357-364
Randomized rounding: a technique for provably good algorithms and algorithmic proofs
P. Raghavan
,
C.D. Thompson
Combinatorica
7
(4), 1987, pp. 365-374
Strong communication complexity or generating quasirandom sequences from two communicating semi-random sources
U. Vazirani
Combinatorica
7
(4), 1987, pp. 375-392
Seiten
<
1
2