| |
 |      |
                                |
Note: Links lead to the DBLP on the Web. Mikhail J. Atallah 65 Mikhail J. Atallah, Frédéric Chyzak , Philippe Dumas : A Randomized Algorithm for Approximate String Matching. Algorithmica 29 (3): 468-486 (2001) 64 Mikhail J. Atallah, Sunil Prabhakar : (Almost) Optimal Parallel Block Access for Range Queries. PODS 2000 : 205-215 63 Chapman Flack , Mikhail J. Atallah: Better Logging through Formality. Recent Advances in Intrusion Detection 2000 : 1-16 62 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) 61 Mikhail J. Atallah, Danny Z. Chen : Parallel Geometric Algorithms in Coarse-Grain Network Models. COCOON 1998 : 55-64 60 Mikhail J. Atallah, Douglas E. Comer : Algorithms for Variable Length Subnet Address Assignment. IEEE Transactions on Computers 47 (6): 693-699 (1998) 59 Mikhail J. Atallah: Efficient Parallel Algorithms for Planar st -Graphs. ISAAC 1997 : 223-232 58 Mikhail J. Atallah, Yann Génin , Wojciech Szpankowski : Pattern Matching Image Compression. Data Compression Conference 1996 : 421 57 Mikhail J. Atallah, Danny Z. Chen : Applications of a Numbering Scheme for Polygonal Obstacles in the Plane. ISAAC 1996 : 1-24 56 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) 55 Mikhail J. Atallah, Danny Z. Chen : Optimal Parallel Hypercube Algorithms for Polygon Problems. IEEE Transactions on Computers 44 (7): 914-922 (1995) 54 Joseph Manning , Mikhail J. Atallah, Kingsley Cudjoe , Joe Lozito , Ron Pacheco : A System for Drawing Graphs with Geometric Symmetry. Graph Drawing 1994 : 262-265 53 Mikhail J. Atallah, Andreas Fabri : On the Multisearching Problem of Hypercubes. PARLE 1994 : 159-166 52 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 51 Mikhail J. Atallah, Michael T. Goodrich , S. Rao Kosaraju : Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. JACM 41 (6): 1049-1088 (1994) 50 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 49 Mikhail J. Atallah, Danny Z. Chen : Computing the All-Pairs Longest Chain in the Plane. WADS 1993 : 1-13 48 Mikhail J. Atallah: A Faster Parallel Algorithm for a Matrix Searching Problem. Algorithmica 9 (2): 156-167 (1993) 47 Michael T. Goodrich , Mikhail J. Atallah, Mark H. Overmars : Output-Sensitive Methods for Rectilinear Hidden Surface Removal. Information and Computation 107 (1): 1-24 (1993) 46 Mikhail J. Atallah, Philippe Pacquet , Wojciech Szpankowski : Pattern Matching With Mismatches: A Probabilistic Analysis and a Randomized Algorithm (Extended Abstract). CPM 1992 : 27-40 45 Mikhail J. Atallah, Jyh-Jong Tsay : On the Parallel-Decomposability of Geometric Problems. Algorithmica 8 (3): 209-231 (1992) 44 Mikhail J. Atallah: Editor's Foreword: Special Issue on the Sixth Annual Symposium on Computational Geometry. Algorithmica 8 (5&6): 343-344 (1992) 43 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) 42 Mikhail J. Atallah, S. Rao Kosaraju : An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix. SODA 1991 : 394-403 41 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 40 Mikhail J. Atallah, Susanne E. Hambrusch , Lynn E. Te Winkel : Topological Numbering of Features on a Mesh. Algorithmica 6 (5): 762-769 (1991) 39 Mikhail J. Atallah, Danny Z. Chen , Hubert Wagener : An Optimal Parallel Algorithm for the Visibility of a Simple Polygon from a Point. JACM 38 (3): 516-533 (1991) 38 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 37 Mikhail J. Atallah, Danny Z. Chen : Parallel Rectilinear Shortest Paths with Rectangular Obstacles. SPAA 1990 : 270-279 36 Mikhail J. Atallah, Paul B. Callahan , Michael T. Goodrich : P-Complete Geometric Problems. SPAA 1990 : 317-326 35 Mikhail J. Atallah: A Faster Parallel Algorithm for a Matrix Searching Problem. SWAT 1990 : 192-200 34 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) 33 Mikhail J. Atallah, S. Rao Kosaraju , Lawrence L. Larmore , Gary L. Miller , Shang-Hua Teng : Constructing Trees in Parallel. SPAA 1989 : 421-431 32 Mikhail J. Atallah, Jyh-Jong Tsay : On the Parallel Decomposability of Geometric Problems. Symposium on Computational Geometry 1989 : 104-113 31 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 30 Mikhail J. Atallah, Susanne E. Hambrusch : Optimal Channel Placement for Multi-Terminal Nets. WADS 1989 : 97-114 29 Mikhail J. Atallah, S. Rao Kosaraju : An Efficient Algorithm for Maxdominance, with Applications. Algorithmica 4 (2): 221-236 (1989) 28 Mikhail J. Atallah, Danny Z. Chen : An Optimal Parallel Algorithm for the Minimum Circle-Cover Problem. IPL 32 (4): 159-165 (1989) 27 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) 26 Mikhail J. Atallah, Michael T. Goodrich , S. Rao Kosaraju : Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. AWOC 1988 : 1-10 25 Mikhail J. Atallah, Michael T. Goodrich : Parallel Algorithms for Some Functions of two Convex Polygons. Algorithmica 3 : 535-548 (1988) 24 Mikhail J. Atallah: On Multidimensional Arrays of Processors. IEEE Transactions on Computers 37 (10): 1306-1309 (1988) 23 Mikhail J. Atallah, Greg N. Frederickson , S. Rao Kosaraju : Sorting with Efficient Use of Special-Purpose Sorters. IPL 27 (1): 13-15 (1988) 22 S. Rao Kosaraju , Mikhail J. Atallah: Optimal Simulations between Mesh-Connected Arrays of Processors. JACM 35 (3): 635-650 (1988) 21 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) 20 Mikhail J. Atallah, Richard Cole , Michael T. Goodrich : Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms. FOCS 1987 : 151-160 19 Mikhail J. Atallah, Chandrajit L. Bajaj : Efficient Algorithms for Common Transversals. IPL 25 (2): 87-91 (1987) 18 Mikhail J. Atallah, Susanne E. Hambrusch : On Bipartite Matchings of Minimum Density. J. Algorithms 8 (4): 480-502 (1987) 17 S. Rao Kosaraju , Mikhail J. Atallah: Optimal Simulations between Mesh-Connected Arrays of Processors (Preliminary Version). STOC 1986 : 264-272 16 Mikhail J. Atallah, Michael T. Goodrich : Efficient Plane Sweeping in Parallel. Symposium on Computational Geometry 1986 : 216-225 15 Mikhail J. Atallah, Susanne E. Hambrusch : Optimal Rotation Problems in Channel Routing. IEEE Transactions on Computers 35 (9): 843-847 (1986) 14 Mikhail J. Atallah, Susanne E. Hambrusch : Solving Tree Problems on a Mesh-Connected Processor Array. Information and Control 69 (1-3): 168-187 (1986) 13 Mikhail J. Atallah: Computing the Convex Hull of Line Intersections. J. Algorithms 7 (2): 285-288 (1986) 12 Mikhail J. Atallah, Susanne E. Hambrusch : Solving Tree Problems on a Mesh-Connected Processor Array (Preliminary Version). FOCS 1985 : 222-231 11 Mikhail J. Atallah, S. Rao Kosaraju : A Generalized Dictionary Machine for VLSI. IEEE Transactions on Computers 34 (2): 151-155 (1985) 10 Mikhail J. Atallah: On Symmetry Detection. IEEE Transactions on Computers 34 (7): 663-666 (1985) 9 Mikhail J. Atallah: A Matching Problem in the Plane. JCSS 31 (1): 63-70 (1985) 8 Mikhail J. Atallah: Parallel Strong Orientation of an Undirected Graph. Information Processing Letters 18 (1): 37-39 (1984) 7 Mikhail J. Atallah, S. Rao Kosaraju : Graph Problems on a Mesh-Connected Processor Array. JACM 31 (3): 649-667 (1984) 6 Mikhail J. Atallah, Uzi Vishkin : Finding Euler Tours in Parallel. JCSS 29 (3): 330-337 (1984) 5 Mikhail J. Atallah: Dynamic Computational Geometry (Preliminary Version). FOCS 1983 : 92-99 4 Mikhail J. Atallah: A Linear Time Algorithm for the Hausdorff Distance Between Convex Polygons. IPL 17 (4): 207-209 (1983) 3 Mikhail J. Atallah, S. Rao Kosaraju : Graph Problems on a Mesh-Connected Processor Array (Preliminary Version). STOC 1982 : 345-353 2 Mikhail J. Atallah: Finding the Cyclic Index of an Irreducible, Nonnegative Matrix. SIAM J. Comput. 11 (3): 567-570 (1982) 1 Mikhail J. Atallah, S. Rao Kosaraju : An Adversary-Based Lower Bound for Sorting. Information Processing Letters 13 (2): 55-57 (1981) DiSC'01 Copyright ©2002 ACM Inc. |
