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="Peinado, Marcus"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Parallel "Go with the winners" algorithms in distributed memory models
Marcus Peinado
,
Thomas Lengauer
Journal Parallel Distributed Computing
63
(9), 2003, pp. 801-814
Go with the winners algorithms for cliques in random graphs
Marcus Peinado
Lecture Notes in Computer Science
2223
, 2001, pp. 525-536
Algorithms for almost-uniform generation with an unbiased binary source
Ömer Eğecioğlu
,
Marcus Peinado
Lecture Notes in Computer Science
1449
, 1998, pp. 117-126
Hiding cliques for cryptographic security
Ari Juels
,
Marcus Peinado
Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98 (San Francisco, California, January 25-27, 1998)
, 1998, pp. 678-684
Random generation of embedded graphs and an extension to Dobrushin uniqueness
Marcus Peinado
,
Thomas Lengauer
Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98 (Dallas, Texas, May 23-26, 1998)
, 1998, pp. 176-185
Design and performance of parallel and distributed approximation algorithms for Maxcut
Steven Homer
,
Marcus Peinado
Journal Parallel Distributed Computing
46
(1), 1997, pp. 48-61
``Go with the Winners'' generators with applications to molecular modeling
Marcus Peinado
,
Thomas Lengauer
Lecture Notes in Computer Science
1269
, 1997, pp. 135-149
Improved lower bounds for the randomized Boppana-Halldórsson algorithm for MAXCLIQUE
Marcus Peinado
Lecture Notes in Computer Science
959
, 1995, pp. 549-558
Hard graphs for randomized subgraph exclusion algorithms
Marcus Peinado
Proceedings of the 4th Scandinavian Workshop on Algorithm Theory - SWAT '94 (Aarhus, Denmark, July 6-8, 1994)
LNCS 824
, 1994, pp. 278-289