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="Jerrum, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved approximation algorithms for MAX
k
-Cut and MAX BISECTION
A. Frieze
,
M. Jerrum
Algorithmica
18
(1), 1997, pp. 67-81
A mildly exponential approximation algorithm for the permanent
M. Jerrum
,
U. Vazirani
Algorithmica
16
, 1996, pp. 392-401
Approximate counting, uniform generation and rapidly mixing Markov chains (extended abstract)
A. Sinclair
,
M. Jerrum
Lecture Notes in Computer Science
314
, 1988, pp. 134-148
Random generation of combinatorial structures from a uniform distribution
M. Jerrum
Lecture Notes in Computer Science
194
, 1985, pp. 290-299
The complexity of finding minimum-length generator sequences
M.R. Jerrum
Theoretical Computer Science
36
(2,3), 1985, pp. 265-289
The complexity of finding minimum-length generator sequences
M. Jerrum
Lecture Notes in Computer Science
172
, 1984, pp. 270-280
Some exact complexity results for straight-line computations over semirings
M. Jerrum
,
M. Snir
Journal of the ACM
29
(3), 1982, pp. 874-897
A compact representation for permutation groups
M. Jerrum
Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'82 (Chicago, IL, November 3-5, 1982)
, 1982, pp. 126-133