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
[2]
Hilfe
Suche: Author="Atallah, Mikhail"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A lower-variance randomized algorithm for approximate string matching
Mikhail J. Atallah
,
Elena Grigorescu
,
Yi Wu
Information Processing Letters
113
(18), 2013, pp. 690-692
Pattern matching in the Hamming distance with thresholds
Mikhail J. Atallah
,
Timothy W. Duket
Information Processing Letters
111
(14), 2011, pp. 674-677
A tree-covering problem arising in integrity of tree-structured data
Mikhail J. Atallah
,
Greg N. Frederickson
,
Ashish Kundu
Information Processing Letters
109
(1), 2008, pp. 79-82
Discrepancy-sensitive dynamic fractional cascading, dominated maxima searching, and 2-d nearest neighbors in any Minkowski metric
Mikhail J. Atallah
,
Marina Blanton
,
Michael T. Goodrich
,
Stanislas Polu
Lecture Notes in Computer Science
4619
, 2007, pp. 114-126
Security issues in collaborative computing
Mikhail J. Atallah
Lecture Notes in Computer Science
4112
, 2006, pp. 2-2
Efficient parallel algorithms for planar
st
-graphs
Mikhail J. Atallah
,
Danny Z. Chen
,
Ovidiu Daescu
Algorithmica
35
(3), 2003, pp. 194-215
Cropping-resilient segmented multiple watermarking
Keith Frikken
,
Mikhail Atallah
Lecture Notes in Computer Science
2748
, 2003, pp. 231-242
Compact recognizers of episode sequences
Alberto Apostolico
,
Mikhail J. Atallah
Information and Computation
174
(2), 2002, pp. 180-192
Secure multi-party computational geometry
Mikhail J. Atallah
,
Wenliang Du
Lecture Notes in Computer Science
2125
, 2001, pp. 165-179
Complexity classes
Eric Allender
,
Michael C. Loui
,
Kenneth W. Regan
Algorithms and Theory of Computation Handbook, 1999, pp. 27-1 - 27-23
Reducibility and completeness
Eric Allender
,
Michael C. Loui
,
Kenneth W. Regan
Algorithms and Theory of Computation Handbook, 1999, pp. 28-1 - 28-28
Other complexity classes and measures
Eric Allender
,
Michael C. Loui
,
Kenneth W. Regan
Algorithms and Theory of Computation Handbook, 1999, pp. 29-1 - 29-24
General pattern matching
Alberto Apostolico
Algorithms and Theory of Computation Handbook, 1999, pp. 13-1 - 13-22
Parallel algorithms for longest increasing chains in the plane and related problems
Mikhail J. Atallah
,
Danny Z. Chen
,
Kevin S. Klenk
Parallel Processing Letters
9
(4), 1999, pp. 511-520
Searching
Ricardo Baeza-Yates
,
Patricio V. Poblete
Algorithms and Theory of Computation Handbook, 1999, pp. 2-1 - 2-15
Parallel algorithms
Guy E. Blelloch
,
Bruce M. Maggs
Algorithms and Theory of Computation Handbook, 1999, pp. 47-1 - 47-44
Electronic cash
Stefan Brands
Algorithms and Theory of Computation Handbook, 1999, pp. 44-1 - 44-40
Linear programming
Vijay Chandru
,
M.R. Rao
Algorithms and Theory of Computation Handbook, 1999, pp. 31-1 - 31-37
Integer programming
Vijay Chandru
,
M.R. Rao
Algorithms and Theory of Computation Handbook, 1999, pp. 32-1 - 32-45
Pattern matching in strings
Maxime Crochmore
,
Christophe Hancart
Algorithms and Theory of Computation Handbook, 1999, pp. 11-1 - 11-28
Text data compression algorithms
Maxime Crochmore
,
Thierry Lecroq
Algorithms and Theory of Computation Handbook, 1999, pp. 12-1 - 12-23
Cryptographic foundations
Yvo Desmedt
Algorithms and Theory of Computation Handbook, 1999, pp. 38-1 - 38-14
Encryption schemes
Yvo Desmedt
Algorithms and Theory of Computation Handbook, 1999, pp. 39-1 - 39-28
Algebraic algorithms
Angel Díaz
,
Ioannis Z. Emiris
,
Erich Kaltofen
,
Victor Y. Pan
Algorithms and Theory of Computation Handbook, 1999, pp. 16-1 - 16-27
Graph drawing algorithms
Peter Eades
,
Petra Mutzel
Algorithms and Theory of Computation Handbook, 1999, pp. 9-1 - 9-26
Seiten 1
2
3
4
5
>