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="Pittel, B."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the number of fixed pairs in a random instance of the stable marriage problem
B. Pittel
,
L. Shepp
,
E. Veklerov
SIAM Journal on Discrete Mathematics
21
(4), 2007, pp. 947-958
Limit shape of a random integer partition with a bounded max-to-min ratio of parts sizes
B. Pittel
Journal of Combinatorial Theory Series A
114
(7), 2007, pp. 1238-1253
Linear probing: the probable largest search time grows logarithmically with the number of records
B. Pittel
Journal of Algorithms
8
(2), 1987, June, pp. 236-249
On growing a random Young tableau
B. Pittel
Journal of Combinatorial Theory Series A
41
, 1986, pp. 278-285
On the most probable shape of a search tree grown from a random permutation
H. Mahmoud
,
B. Pittel
SIAM Journal on Algebraic Discrete Methods
5
(1), 1984, March, pp. 69-81
The worst and the most probable performance of a class of set-covering algorithms
V. Lifschitz
,
B. Pittel
SIAM Journal on Computing
12
(2), 1983, May, pp. 329-346
The number of increasing subsequences of the random permutation
V. Lifschitz
,
B. Pittel
Journal of Combinatorial Theory Series A
31
, 1981, pp. 1-20