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="Naor, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
N. Alon
,
M. Naor
Algorithmica
16
, 1996, pp. 434-449
Checking the correctness of memories
M. Blum
,
W. Evans
,
P. Gemmell
,
S. Kannan
,
M. Naor
Algorithmica
12
, 1994, pp. 225-244
Fault tolerant graphs, perfect hash functions and disjoint paths
M. Ajtai
,
N. Alon
,
J. Bruck
,
R. Cypher
,
C.T. Ho
,
M. Naor
,
E. Szemerédi
Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'92 (Pittsburgh, PA, October 24-27, 1992)
, 1992, pp. 693-702
Nonoblivious hashing
A. Fiat
,
M. Naor
,
J.P. Schmidt
,
A. Siegel
Journal of the ACM
39
(4), 1992, October, pp. 764-782
String matching with preprocessing of text and pattern
M. Naor
Lecture Notes in Computer Science
510
, 1991, pp. 739-750
Coin-flipping games immune against linear-sized coalitions
N. Alon
,
M. Naor
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~I, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 46-54
Small bias probability spaces: Efficient constructions and applications
J. Naor
,
M. Naor
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC'90 (Baltimore, Maryland, May 14--16, 1990)
, 1990, pp. 213-223
Public-key cryptosystems provably secure against chosen ciphertext attacks
M. Naor
,
M. Yung
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC'90 (Baltimore, Maryland, May 14--16, 1990)
, 1990, pp. 427-437
On dice and coins: Models of computation for random generation
D. Feldman
,
R. Impagliazzo
,
M. Naor
,
N. Nisan
,
S. Rudich
,
A. Shamir
Lecture Notes in Computer Science
372
, 1989, pp. 319-340
Efficient cryptographic schemes provably as secure as subset sum
R. Impagliazzo
,
M. Naor
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 236-241
The probabilistic method yields deterministic parallel algorithms
R. Motwani
,
J. Naor
,
M. Naor
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 8-13
Decision trees and downward closures
R. Impagliazzo
,
M. Naor
Proceedings of the 3rd Annual Conference on Structure in Complexity Theory, CSCT'88 (Georgetown University, Washington D.C., June 14-17 1988)
, 1988, pp. 29-38
Fast parallel algorithms for chordal graphs
J. Naor
,
M. Naor
,
A. Schäffer
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 355-364