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="Blum, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Checking the correctness of memories
M. Blum
,
W. Evans
,
P. Gemmell
,
S. Kannan
,
M. Naor
Algorithmica
12
, 1994, pp. 225-244
Checking approximate computations over the reals
S. Ar
,
M. Blum
,
B. Codenotti
,
P. Gemmell
Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC'93 (San Diego, California, May 16--18, 1993)
, 1993, pp. 786-795
Self-testing/correcting with applications to numerical problems
M. Blum
,
M. Luby
,
R. Rubinfeld
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC'90 (Baltimore, Maryland, May 14--16, 1990)
, 1990, pp. 73-83
Generic oracles and oracle classes
M. Blum
,
R. Impagliazzo
Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, FOCS'87 (Los Angeles, CA, October 12-14, 1987)
, 1987, pp. 118-126
A simple unpredictable pseudo-random number generator
L. Blum
,
M. Blum
,
M. Shub
SIAM Journal on Computing
15
(2), 1986, May, pp. 364-383
Independent unbiased coin flips from a correlated biased source--a finite state Markov chain
M. Blum
Combinatorica
6
(2), 1986, pp. 97-108
How to generate cryptographically strong sequences of pseudo-random bits
M. Blum
,
S. Micali
SIAM Journal on Computing
13
(4), 1984, November, pp. 850-864
Independent unbiased coin flips from a correlated biased source: A finite state Markov chain
M. Blum
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 425-433
How to exchange (secret) keys
M. Blum
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, STOC'83 (Boston, MA, May 25-27, 1983)
, 1983, pp. 440-447
How to generate cryptographically strong sequences of pseudo random bits
M. Blum
,
S. Micali
Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'82 (Chicago, IL, November 3-5, 1982)
, 1982, pp. 112-117
The complexity of testing whether a graph is a superconcentrator
M. Blum
,
R.M. Karp
,
O. Vornberger
,
C.H. Papadimitriou
,
M. Yannakakis
Information Processing Letters
13
(4-5), 1981, pp. 164-167
Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
M. Blum
,
A.K. Chandra
,
M.N. Wegman
Information Processing Letters
10
(2), 1980, March, pp. 80-82
On the power of the compass (or, why mazes are easier to search than graphs)
M. Blum
,
D. Kozen
Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, FOCS'78 (Ann Arbor, MI, October 16-18, 1978)
, 1978, pp. 132-142
Finite automata in a 2-dimensional space
M. Blum
,
W. Sakoda
Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science, FOCS'77 (Providence, RI, October 31 - November 2, 1977)
, 1977, pp. 147-161
Time bounds for selection
M. Blum
,
R.W. Floyd
,
V.R. Pratt
,
R.L. Rivest
,
R.E. Tarjan
Journal of Computer and System Sciences
7
, 1973, pp. 448-461
Linear time bounds for median computations
M. Blum
,
R.W. Floyd
,
V. Pratt
,
R.L. Rivest
,
R.E. Tarjan
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, STOC'72 (Denver, CO, May 1-3, 1972)
, 1972, pp. 119-124
On effective procedures for speeding up algorithms
M. Blum
Proceedings of the 1st Annual ACM Symposium on Theory of Computing, STOC'69 (Marina del Rey, CA, May 5-7, 1969)
, 1969, pp. 43-53