| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Mikhail J. Atallah Mikhail J. Atallah, Jiangtao Li : Enhanced Smart-card based License Management. CEC 2003 : 111-119 Mikhail J. Atallah, Hicham G. Elmongui , Vinayak Deshpande , Leroy B. Schwarz : Secure Supply-Chain Protocols. CEC 2003 : 293-302 Mikhail J. Atallah, Keith Frikken : Replicated Parallel I/O without Additional Scheduling Costs. DEXA 2003 : 223-232 Robert Gwadera , Mikhail J. Atallah, Wojciech Szpankowski : Reliable Detection of Episodes in Event Sequences. ICDM 2003 : 67-74 Ioannis Ioannidis , Ananth Grama , Mikhail J. Atallah: Adaptive Data Structures for IP Lookups. INFOCOM 2003 Radu Sion , Mikhail J. Atallah, Sunil Prabhakar : On-the-fly Intrusion Detection for Web Portals. ITCC 2003 : 325-330 Radu Sion , Mikhail J. Atallah, Sunil Prabhakar : Resilient Information Hiding for Abstract Semi-structures. IWDW 2003 : 141-153 Mikhail J. Atallah, Stefano Lonardi : Authentication of LZ-77 Compressed Data. SAC 2003 : 282-287 Radu Sion , Mikhail J. Atallah, Sunil Prabhakar : Rights Protection for Relational Data. SIGMOD Conference 2003 : 98-109 Keith Frikken , Mikhail J. Atallah: Cropping-Resilient Segmented Multiple Watermarking. WADS 2003 : 231-242 Mikhail J. Atallah, Danny Z. Chen , Ovidiu Daescu : Efficient Parallel Algorithms for Planar st -Graphs. Algorithmica 35 (3): 194-215 (2003) Mikhail J. Atallah, Sunil Prabhakar : (Almost) Optimal parallel block access for range queries. Inf. Sci. 157 : 21-31 (2003) Keith Frikken , Mikhail J. Atallah, Sunil Prabhakar , Reihaneh Safavi-Naini : Optimal Parallel I/O for Range Queries through Replication. DEXA 2002 : 669-678 Christos Berberidis , Walid G. Aref , Mikhail J. Atallah, Ioannis P. Vlahavas , Ahmed K. Elmagarmid : Multiple and Partial Periodicity Mining in Time Series Databases. ECAI 2002 : 370-374 Ioannis Ioannidis , Ananth Grama , Mikhail J. Atallah: A Secure Protocol for Computing Dot-Products in Clustered and Distributed Environments. ICPP 2002 : 379-384 Radu Sion , Mikhail J. Atallah, Sunil Prabhakar : On Watermarking Numeric Sets. IWDW 2002 : 130-146 Mikhail J. Atallah, Victor Raskin , Christian Hempelmann , Mercan Karahan , Radu Sion , Umut Topkara , Katrina E. Triezenberg : Natural Language Watermarking and Tamperproofing. Information Hiding 2002 : 196-212 Christos Berberidis , Ioannis P. Vlahavas , Walid G. Aref , Mikhail J. Atallah, Ahmed K. Elmagarmid : On the Discovery of Weak Periodicities in Large Time Series. PKDD 2002 : 51-61 Alberto Apostolico , Mikhail J. Atallah: Compact Recognizers of Episode Sequences. Inf. Comput. 174 (2): 180-192 (2002) Wenliang Du , Mikhail J. Atallah: Privacy-Preserving Cooperative Statistical Analysis. ACSAC 2001 : 102-112 Wenliang Du , Mikhail J. Atallah: Privacy-Preserving Cooperative Scientific Computations. CSFW 2001 : 273-294 Hoi Chang , Mikhail J. Atallah: Protecting Software Code by Guards. Digital Rights Management Workshop 2001 : 160-175 Mikhail J. Atallah, Victor Raskin , Michael Crogan , Christian Hempelmann , Florian Kerschbaum , Dina Mohamed , Sanket Naik : Natural Language Watermarking: Design, Analysis, and a Proof-of-Concept Implementation. Information Hiding 2001 : 185-199 Mikhail J. Atallah, Wenliang Du : Secure Multi-party Computational Geometry. WADS 2001 : 165-179 Mikhail J. Atallah, Frédéric Chyzak , Philippe Dumas : A Randomized Algorithm for Approximate String Matching. Algorithmica 29 (3): 468-486 (2001) Mikhail J. Atallah: On Estimating the Large Entries of a Convolution. IEEE Trans. Computers 50 (3): 193-196 (2001) Mikhail J. Atallah, Danny Z. Chen : On Connecting Red and Blue Rectilinear Polygonal Obstacles with Nonintersecting Monotone Rectilinear Paths. Int. J. Comput. Geometry Appl. 11 (4): 373-400 (2001) Mikhail J. Atallah, Sunil Prabhakar : (Almost) Optimal Parallel Block Access for Range Queries. PODS 2000 : 205-215 Chapman Flack , Mikhail J. Atallah: Better Logging through Formality. Recent Advances in Intrusion Detection 2000 : 1-16 M. G. Andrews , Mikhail J. Atallah, Danny Z. Chen , D. T. Lee : Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems. Algorithmica 26 (2): 263-289 (2000) Mikhail J. Atallah, Yann Génin , Wojciech Szpankowski : Pattern Matching Image Compression: Algorithmic and Empirical Results. IEEE Transactions on Pattern Analysis and Machine Intelligence 21 (7): 614-627 (1999) Mikhail J. Atallah: An Improved Hypercube Bound for Multisearching and Its Applications. Int. J. Comput. Geometry Appl. 9 (1): 29- (1999) Mikhail J. Atallah, Danny Z. Chen , Kevin S. Klenk : Parallel Algorithms for Longest Increasing Chains in the Plane and Related Problems. Parallel Processing Letters 9 (4): 511-520 (1999) Mikhail J. Atallah, Danny Z. Chen : Parallel Geometric Algorithms in Coarse-Grain Network Models. COCOON 1998 : 55-64 Mikhail J. Atallah, Douglas Comer : Algorithms for Variable Length Subnet Address Assignment. IEEE Trans. Computers 47 (6): 693-699 (1998) Mikhail J. Atallah, Danny Z. Chen , Kevin S. Klenk : Parallel algorithms for longest increasing chains in the plane and related problems. CCCG 1997 Mikhail J. Atallah: Efficient Parallel Algorithms for Planar st -Graphs. ISAAC 1997 : 223-232 Mikhail J. Atallah, Yann Génin , Wojciech Szpankowski : Pattern Matching Image Compression. Data Compression Conference 1996 : 421 Mikhail J. Atallah, Danny Z. Chen : Applications of a Numbering Scheme for Polygonal Obstacles in the Plane. ISAAC 1996 : 1-24 M. G. Andrews , Mikhail J. Atallah, Danny Z. Chen , D. T. Lee : Parallel algorithms for maximum matching in interval graphs. IPPS 1995 : 84-92 Mikhail J. Atallah, Danny Z. Chen , D. T. Lee : An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications. Algorithmica 14 (5): 429-441 (1995) Mikhail J. Atallah, Andreas Fabri : On the Multisearching Problem for Hypercubes. Comput. Geom. 5 : 293-302 (1995) Mikhail J. Atallah, Danny Z. Chen : Optimal Parallel Hypercube Algorithms for Polygon Problems. IEEE Trans. Computers 44 (7): 914-922 (1995) Mikhail J. Atallah, Danny Z. Chen : Computing the all-pairs longest chains in the plane. Int. J. Comput. Geometry Appl. 5 (3): 257-271 (1995) Joseph Manning , Mikhail J. Atallah, Kingsley Cudjoe , Joe Lozito , Ron Pacheco : A System for Drawing Graphs with Geometric Symmetry. Graph Drawing 1994 : 262-265 Mikhail J. Atallah, Andreas Fabri : On the Multisearching Problem of Hypercubes. PARLE 1994 : 159-166 Mikhail J. Atallah, Michael T. Goodrich , Kumar Ramaiyer : Biased Finger Trees and Three-Dimensional Layers of Maxima (Preliminary Version). Symposium on Computational Geometry 1994 : 150-159 Mikhail J. Atallah, Michael T. Goodrich , S. Rao Kosaraju : Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. J. ACM 41 (6): 1049-1088 (1994) Mikhail J. Atallah, Frank K. H. A. Dehne , Russ Miller , Andrew Rau-Chaplin , Jyh-Jong Tsay : Multisearch Techniques: Parallel Data Structures on Mesh-Connected Computers. J. Parallel Distrib. Comput. 20 (1): 1-13 (1994) Daniel W. Watson , Howard Jay Siegel , John K. Antonio , Mark A. Nichols , Mikhail J. Atallah: A Block-Based Mode Selection Model for SIMD/SPMD Parallel Environments. J. Parallel Distrib. Comput. 21 (3): 271-288 (1994) Mikhail J. Atallah, Danny Z. Chen : On Parallel Rectilinear Obstacle-avoiding Paths. CCCG 1993 : 210-215 Mikhail J. Atallah, Danny Z. Chen , D. T. Lee : An Optimal Algorithm for Shortest Paths on Weighted Interval and Circular-Arc Graphs, with Applications. ESA 1993 : 13-24 Mikhail J. Atallah, Danny Z. Chen : Optimal Parallel Hypercube Algorithms for Polygon Problems. SPDP 1993 : 208-215 Mikhail J. Atallah, Danny Z. Chen : Computing the All-Pairs Longest Chain in the Plane. WADS 1993 : 1-13 Mikhail J. Atallah: A Faster Parallel Algorithm for a Matrix Searching Problem. Algorithmica 9 (2): 156-167 (1993) Mikhail J. Atallah, Danny Z. Chen : On Parallel Rectilinear Obstacle- Avoiding Paths. Comput. Geom. 3 : 307-313 (1993) Alberto Apostolico , Mikhail J. Atallah, Susanne E. Hambrusch : New Clique and Independent Set Algorithms for Circle Graphs (Discrete Applied Mathematics 36 (1992) 1-24). Discrete Applied Mathematics 41 (2): 179-180 (1993) Michael T. Goodrich , Mikhail J. Atallah, Mark H. Overmars : Output-Sensitive Methods for Rectilinear Hidden Surface Removal Inf. Comput. 107 (1): 1-24 (1993) Mikhail J. Atallah, Paul B. Callahan , Michael T. Goodrich : P-complete geometric problems. Int. J. Comput. Geometry Appl. 3 (4): 443-462 (1993) Mikhail J. Atallah, Philippe Jacquet , Wojciech Szpankowski : A Probabilistic Analysis of a Pattern Matching Problem. Random Structures and Algorithms 4 (2): 191-214 (1993) Mikhail J. Atallah, Philippe Pacquet , Wojciech Szpankowski : Pattern Matching With Mismatches: A Probabilistic Analysis and a Randomized Algorithm (Extended Abstract). CPM 1992 : 27-40 Mikhail J. Atallah, Jyh-Jong Tsay : On the Parallel-Decomposability of Geometric Problems. Algorithmica 8 (3): 209-231 (1992) Mikhail J. Atallah: Editor's Foreword: Special Issue on the Sixth Annual Symposium on Computational Geometry. Algorithmica 8 (5&6): 343-344 (1992) Josef Manning , Mikhail J. Atallah: Fast Detection and Display of Symmetry in Outerplanar Graphs. Discrete Applied Mathematics 39 (1): 13-35 (1992) Mikhail J. Atallah, S. Rao Kosaraju : An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix. J. Algorithms 13 (3): 394-413 (1992) Mikhail J. Atallah, Christina Lock Black , Dan C. Marinescu , Howard Jay Siegel , Thomas L. Casavant : Models and Algorithms for Coscheduling Compute-Intensive Tasks on a Network of Workstations. J. Parallel Distrib. Comput. 16 (4): 318-327 (1992) Mikhail J. Atallah, S. Rao Kosaraju : An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix. SODA 1991 : 394-403 Mikhail J. Atallah, Frank K. H. A. Dehne , Russ Miller , Andrew Rau-Chaplin , Jyh-Jong Tsay : Multisearch Techniques for Implementing Data Structures on a Mesh-Connected Computer (Preliminary Version). SPAA 1991 : 204-214 Mikhail J. Atallah, Susanne E. Hambrusch , Lynn E. Te Winkel : Topological Numbering of Features on a Mesh. Algorithmica 6 (5): 762-769 (1991) Mikhail J. Atallah, Danny Z. Chen : Parallel Rectilinear Shortest Paths with Rectangular Obstacles. Comput. Geom. 1 : 79-113 (1991) Mikhail J. Atallah, Danny Z. Chen , Hubert Wagener : An Optimal Parallel Algorithm for the Visibility of a Simple Polygon from a Point. J. ACM 38 (3): 516-533 (1991) Michael T. Goodrich , Mikhail J. Atallah, Mark H. Overmars : An Input-Size/Output-Size Trade-Off in the Time-Complexity of Rectilinear Hidden Surface Removal (Preliminary Version). ICALP 1990 : 689-702 Mikhail J. Atallah, Danny Z. Chen : Parallel Rectilinear Shortest Paths with Rectangular Obstacles. SPAA 1990 : 270-279 Mikhail J. Atallah, Paul B. Callahan , Michael T. Goodrich : P-Complete Geometric Problems. SPAA 1990 : 317-326 Mikhail J. Atallah: A Faster Parallel Algorithm for a Matrix Searching Problem. SWAT 1990 : 192-200 Michael T. Goodrich , Mikhail J. Atallah: On Performing Robust Order Statistics in Tree-Structured Dictionary Machines. J. Parallel Distrib. Comput. 9 (1): 69-76 (1990) Alberto Apostolico , Mikhail J. Atallah, Lawrence L. Larmore , Scott McFaddin : Efficient Parallel Algorithms for String Editing and Related Problems. SIAM J. Comput. 19 (5): 968-988 (1990) Mikhail J. Atallah, S. Rao Kosaraju , Lawrence L. Larmore , Gary L. Miller , Shang-Hua Teng : Constructing Trees in Parallel. SPAA 1989 : 421-431 Mikhail J. Atallah, Jyh-Jong Tsay : On the Parallel Decomposability of Geometric Problems. Symposium on Computational Geometry 1989 : 104-113 Mikhail J. Atallah, Danny Z. Chen : Optimal Parallel Algorithm for Visibility of a Simple Polygon from a Point. Symposium on Computational Geometry 1989 : 114-123 Mikhail J. Atallah, Susanne E. Hambrusch : Optimal Channel Placement for Multi-Terminal Nets. WADS 1989 : 97-114 Mikhail J. Atallah, S. Rao Kosaraju : An Efficient Algorithm for Maxdominance, with Applications. Algorithmica 4 (2): 221-236 (1989) Mikhail J. Atallah, Danny Z. Chen : An Optimal Parallel Algorithm for the Minimum Circle-Cover Problem. Inf. Process. Lett. 32 (4): 159-165 (1989) Mikhail J. Atallah, Richard Cole , Michael T. Goodrich : Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms. SIAM J. Comput. 18 (3): 499-532 (1989) Mikhail J. Atallah, Michael T. Goodrich , S. Rao Kosaraju : Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. AWOC 1988 : 1-10 Mikhail J. Atallah, Michael T. Goodrich : Parallel Algorithms for Some Functions of two Convex Polygons. Algorithmica 3 : 535-548 (1988) Mikhail J. Atallah: On Multidimensional Arrays of Processors. IEEE Trans. Computers 37 (10): 1306-1309 (1988) Mikhail J. Atallah, Greg N. Frederickson , S. Rao Kosaraju : Sorting with Efficient Use of Special-Purpose Sorters. Inf. Process. Lett. 27 (1): 13-15 (1988) S. Rao Kosaraju , Mikhail J. Atallah: Optimal simulations between mesh-connected arrays of processors. J. ACM 35 (3): 635-650 (1988) Mikhail J. Atallah, S. Rao Kosaraju : Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel. SIAM J. Comput. 17 (5): 849-869 (1988) Mikhail J. Atallah, Richard Cole , Michael T. Goodrich : Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms FOCS 1987 : 151-160 Mikhail J. Atallah, Chandrajit L. Bajaj : Efficient Algorithms for Common Transversals. Inf. Process. Lett. 25 (2): 87-91 (1987) Mikhail J. Atallah, Susanne E. Hambrusch : On Bipartite Matchings of Minimum Density. J. Algorithms 8 (4): 480-502 (1987) S. Rao Kosaraju , Mikhail J. Atallah: Optimal Simulations between Mesh-Connected Arrays of Processors (Preliminary Version) STOC 1986 : 264-272 Mikhail J. Atallah, Michael T. Goodrich : Efficient Plane Sweeping in Parallel. Symposium on Computational Geometry 1986 : 216-225 Mikhail J. Atallah, Susanne E. Hambrusch : Optimal Rotation Problems in Channel Routing. IEEE Trans. Computers 35 (9): 843-847 (1986) Mikhail J. Atallah, Susanne E. Hambrusch : Solving Tree Problems on a Mesh-Connected Processor Array Information and Control 69 (1-3): 168-187 (1986) Mikhail J. Atallah: Computing the Convex Hull of Line Intersections. J. Algorithms 7 (2): 285-288 (1986) Mikhail J. Atallah, Michael T. Goodrich : Efficient Parallel Solutions to Some Geometric Problems. J. Parallel Distrib. Comput. 3 (4): 492-507 (1986) Mikhail J. Atallah, Susanne E. Hambrusch : Solving Tree Problems on a Mesh-Connected Processor Array (Preliminary Version) FOCS 1985 : 222-231 Mikhail J. Atallah, Michael T. Goodrich : Efficient Parallel Solutions to Geometric Problems. ICPP 1985 : 411-417 Mikhail J. Atallah, S. Rao Kosaraju : A Generalized Dictionary Machine for VLSI. IEEE Trans. Computers 34 (2): 151-155 (1985) Mikhail J. Atallah: On Symmetry Detection. IEEE Trans. Computers 34 (7): 663-666 (1985) Mikhail J. Atallah: A Matching Problem in the Plane. J. Comput. Syst. Sci. 31 (1): 63-70 (1985) Mikhail J. Atallah: Parallel Strong Orientation of an Undirected Graph. Inf. Process. Lett. 18 (1): 37-39 (1984) Mikhail J. Atallah, S. Rao Kosaraju : Graph Problems on a Mesh-Connected Processor Array. J. ACM 31 (3): 649-667 (1984) Mikhail J. Atallah, Uzi Vishkin : Finding Euler Tours in Parallel. J. Comput. Syst. Sci. 29 (3): 330-337 (1984) Mikhail J. Atallah: Dynamic Computational Geometry (Preliminary Version) FOCS 1983 : 92-99 Mikhail J. Atallah: A Linear Time Algorithm for the Hausdorff Distance Between Convex Polygons. Inf. Process. Lett. 17 (4): 207-209 (1983) Mikhail J. Atallah, S. Rao Kosaraju : Graph Problems on a Mesh-Connected Processor Array (Preliminary Version) STOC 1982 : 345-353 Mikhail J. Atallah: Finding the Cyclic Index of an Irreducible, Nonnegative Matrix. SIAM J. Comput. 11 (3): 567-570 (1982) Mikhail J. Atallah, S. Rao Kosaraju : An Adversary-Based Lower Bound for Sorting. Inf. Process. Lett. 13 (2): 55-57 (1981) 1 [ 73 ] [ 83 ] 2 [ 63 ] 3 [ 36 ] [ 56 ] [ 94 ] 4 [ 95 ] [ 99 ] 5 [ 21 ] 6 [ 95 ] [ 99 ] 7 [ 47 ] 8 [ 39 ] [ 54 ] 9 [ 47 ] 10 [ 91 ] 11 [ 30 ] [ 33 ] [ 40 ] [ 42 ] [ 43 ] [ 57 ] [ 59 ] [ 60 ] [ 61 ] [ 62 ] [ 69 ] [ 70 ] [ 72 ] [ 73 ] [ 74 ] [ 77 ] [ 79 ] [ 80 ] [ 83 ] [ 86 ] [ 102 ] 12 [ 88 ] 13 [ 22 ] [ 29 ] 14 [ 78 ] 15 [ 90 ] 16 [ 68 ] 17 [ 102 ] 18 [ 45 ] [ 64 ] 19 [ 111 ] 20 [ 89 ] [ 92 ] [ 93 ] 21 [ 88 ] 22 [ 95 ] [ 99 ] 23 [ 111 ] 24 [ 67 ] [ 71 ] 25 [ 84 ] 26 [ 25 ] 27 [ 100 ] [ 103 ] [ 110 ] 28 [ 75 ] [ 82 ] 29 [ 12 ] [ 14 ] [ 18 ] [ 22 ] [ 27 ] [ 28 ] [ 29 ] [ 37 ] [ 39 ] [ 41 ] [ 54 ] [ 55 ] [ 65 ] [ 66 ] 30 [ 98 ] [ 108 ] 31 [ 109 ] 32 [ 13 ] [ 16 ] [ 17 ] [ 20 ] [ 32 ] [ 44 ] [ 56 ] 33 [ 90 ] [ 96 ] 34 [ 98 ] [ 108 ] 35 [ 53 ] 36 [ 96 ] 37 [ 90 ] 38 [ 77 ] [ 80 ] 39 [ 1 ] [ 3 ] [ 7 ] [ 11 ] [ 19 ] [ 23 ] [ 24 ] [ 25 ] [ 28 ] [ 31 ] [ 35 ] [ 46 ] [ 48 ] [ 65 ] 40 [ 35 ] [ 36 ] 41 [ 61 ] [ 72 ] [ 73 ] [ 83 ] 42 [ 112 ] 43 [ 105 ] 44 [ 68 ] 45 [ 49 ] 46 [ 68 ] 47 [ 47 ] 48 [ 36 ] 49 [ 35 ] 50 [ 45 ] [ 64 ] 51 [ 90 ] 52 [ 90 ] 53 [ 63 ] 54 [ 41 ] [ 55 ] 55 [ 68 ] 56 [ 52 ] 57 [ 85 ] [ 97 ] [ 100 ] [ 101 ] [ 104 ] [ 106 ] [ 107 ] 58 [ 66 ] 59 [ 90 ] [ 96 ] 60 [ 45 ] [ 64 ] 61 [ 100 ] 62 [ 111 ] 63 [ 47 ] [ 63 ] 64 [ 96 ] [ 97 ] [ 104 ] [ 106 ] [ 107 ] 65 [ 52 ] [ 53 ] [ 75 ] [ 82 ] [ 109 ] 66 [ 35 ] 67 [ 96 ] 68 [ 96 ] 69 [ 34 ] [ 45 ] [ 51 ] [ 64 ] 70 [ 6 ] 71 [ 95 ] [ 99 ] 72 [ 42 ] 73 [ 63 ] 74 [ 44 ]  ©2004 Association for Computing Machinery |
