2009 | ||
---|---|---|
185 | EE | Mohamed Yakout, Mikhail J. Atallah, Ahmed K. Elmagarmid: Efficient Private Record Linkage. ICDE 2009: 1283-1286 |
184 | EE | Hao Yuan, Mikhail J. Atallah: Efficient data structures for range-aggregate queries on trees. ICDT 2009: 111-120 |
183 | EE | Mikhail J. Atallah, Marina Blanton, Nelly Fazio, Keith B. Frikken: Dynamic and Efficient Key Management for Access Hierarchies. ACM Trans. Inf. Syst. Secur. 12(3): (2009) |
182 | EE | Mikhail J. Atallah, Marina Blanton, Michael T. Goodrich, Stanislas Polu: Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric CoRR abs/0904.4670: (2009) |
181 | EE | Daniel G. Aliaga, Mikhail J. Atallah: Genuinity Signatures: Designing Signatures for Verifying 3D Object Genuinity. Comput. Graph. Forum 28(2): 437-446 (2009) |
2008 | ||
180 | EE | Mikhail J. Atallah, Keith B. Frikken, Marina Blanton, YounSun Cho: Private combinatorial group testing. ASIACCS 2008: 312-320 |
179 | EE | Hao Yuan, Mikhail J. Atallah: Efficient Distributed Third-Party Data Authentication for Tree Hierarchies. ICDCS 2008: 184-193 |
178 | EE | Yinian Qi, Mikhail J. Atallah: Efficient Privacy-Preserving k-Nearest Neighbor Search. ICDCS 2008: 311-319 |
177 | EE | Mikhail J. Atallah, YounSun Cho, Ashish Kundu: Efficient Data Authentication in an Environment of Untrusted Third-Party Distributors. ICDE 2008: 696-704 |
176 | EE | David Benjamin, Mikhail J. Atallah: Private and Cheating-Free Outsourcing of Algebraic Computations. PST 2008: 240-245 |
175 | EE | Mikhail J. Atallah, Eric Bryant, John T. Korb, John R. Rice: Binding software to specific native hardware in a VM environment: the puf challenge and opportunity. VMSec 2008: 45-48 |
174 | EE | Danfeng Yao, Keith B. Frikken, Mikhail J. Atallah, Roberto Tamassia: Private Information: To Reveal or not to Reveal. ACM Trans. Inf. Syst. Secur. 12(1): (2008) |
173 | EE | Mikhail J. Atallah, Greg N. Frederickson, Ashish Kundu: A tree-covering problem arising in integrity of tree-structured data. Inf. Process. Lett. 109(1): 79-82 (2008) |
2007 | ||
172 | EE | Mikhail J. Atallah, Marina Blanton, Keith B. Frikken: Efficient techniques for realizing geo-spatial access control. ASIACCS 2007: 82-92 |
171 | EE | Mikhail J. Atallah, Marina Blanton, Keith B. Frikken: Incorporating Temporal Capabilities in Existing Key Management Schemes. ESORICS 2007: 515-530 |
170 | EE | Umut Topkara, Mikhail J. Atallah, Mercan Topkara: Passwords decay, words endure: secure and re-usable multiple password mnemonics. SAC 2007: 292-299 |
169 | EE | Umut Topkara, Mercan Topkara, Mikhail J. Atallah: Passwords for Everyone: Secure Mnemonic-based Accessible Authentication. USENIX Annual Technical Conference 2007: 369-374 |
168 | EE | Mikhail J. Atallah, Marina Blanton, Michael T. Goodrich, Stanislas Polu: Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric. WADS 2007: 114-126 |
2006 | ||
167 | EE | Mikhail J. Atallah: Security Issues in Collaborative Computing. COCOON 2006: 2 |
166 | EE | Mikhail J. Atallah, Marina Blanton, Keith B. Frikken, Jiangtao Li: Efficient Correlated Action Selection. Financial Cryptography 2006: 296-310 |
165 | EE | Danfeng Yao, Keith B. Frikken, Mikhail J. Atallah, Roberto Tamassia: Point-Based Trust: Define How Much Privacy Is Worth. ICICS 2006: 190-209 |
164 | EE | Umut Topkara, Mercan Topkara, Mikhail J. Atallah: The hiding virtues of ambiguity: quantifiably resilient watermarking of natural language text through synonym substitutions. MM&Sec 2006: 164-174 |
163 | EE | Keith B. Frikken, Jiangtao Li, Mikhail J. Atallah: Trust Negotiation with Hidden Credentials, Hidden Policies, and Policy Cycles. NDSS 2006 |
162 | EE | Ryan Stutsman, Christian Grothoff, Mikhail J. Atallah, Krista Grothoff: Lost in just the translation. SAC 2006: 338-345 |
161 | EE | Mikhail J. Atallah, Marina Blanton, Keith B. Frikken: Key management for non-tree access hierarchies. SACMAT 2006: 11-18 |
160 | EE | Sundararaman Jeyaraman, Mikhail J. Atallah: An empirical study of automatic event reconstruction systems. Digital Investigation 3(Supplement-1): 108-115 (2006) |
159 | EE | Keith B. Frikken, Mikhail J. Atallah, Jiangtao Li: Attribute-Based Access Control with Hidden Policies and Hidden Credentials. IEEE Trans. Computers 55(10): 1259-1270 (2006) |
158 | EE | Radu Sion, Mikhail J. Atallah, Sunil Prabhakar: Rights Protection for Discrete Numeric Streams. IEEE Trans. Knowl. Data Eng. 18(5): 699-714 (2006) |
157 | EE | Marina Blanton, Mikhail J. Atallah: Succinct representation of flexible and privacy-preserving access rights. VLDB J. 15(4): 334-354 (2006) |
2005 | ||
156 | EE | Mikhail J. Atallah, Keith B. Frikken, Marina Blanton: Dynamic and efficient key management for access hierarchies. ACM Conference on Computer and Communications Security 2005: 190-202 |
155 | EE | Keith B. Frikken, Mikhail J. Atallah, Chen Zhang: Privacy-preserving credit checking. ACM Conference on Electronic Commerce 2005: 147-154 |
154 | EE | Michael T. Goodrich, Mikhail J. Atallah, Roberto Tamassia: Indexing Information for Data Forensics. ACNS 2005: 206-221 |
153 | EE | Keith B. Frikken, Mikhail J. Atallah, Marina Bykova: Remote Revocation of Smart Cards in a Private DRM System. ACSW Frontiers 2005: 169-178 |
152 | EE | Mikhail J. Atallah: A Survey of Watermarking Techniques for Non-Media Digital Objects (Invited Talk). ACSW Frontiers 2005: 73 |
151 | EE | Keith B. Frikken, Mikhail J. Atallah: Achieving Fairness in Private Contract Negotiation. Financial Cryptography 2005: 270-284 |
150 | EE | Mikhail J. Atallah, Keith B. Frikken, Michael T. Goodrich, Roberto Tamassia: Secure Biometric Authentication for Weak Computational Devices. Financial Cryptography 2005: 357-371 |
149 | EE | Mikhail J. Atallah: Data Confidentiality in Collaborative Computing. HiPC 2005: 1 |
148 | EE | Mercan Topkara, Ashish Kamra, Mikhail J. Atallah, Cristina Nita-Rotaru: ViWiD : Visible Watermarking Based Defense Against Phishing. IWDW 2005: 470-483 |
147 | EE | Christian Grothoff, Krista Grothoff, Ludmila Alkhutova, Ryan Stutsman, Mikhail J. Atallah: Translation-Based Steganography. Information Hiding 2005: 219-233 |
146 | EE | Marina Blanton, Mikhail J. Atallah: Provable bounds for portable and flexible privacy-preserving access. SACMAT 2005: 95-101 |
145 | Robert Gwadera, Mikhail J. Atallah, Wojciech Szpankowski: Markov Models for Identification of Significant Episodes. SDM 2005 | |
144 | EE | Ioannis Ioannidis, Ananth Grama, Mikhail J. Atallah: Adaptive data structures for IP lookups. ACM Journal of Experimental Algorithmics 10: (2005) |
143 | EE | Ahsan Habib, Dongyan Xu, Mikhail J. Atallah, Bharat K. Bhargava, John Chuang: A Tree-Based Forward Digest Protocol to Verify Data Integrity in Distributed Media Streaming. IEEE Trans. Knowl. Data Eng. 17(7): 1010-1014 (2005) |
142 | EE | Radu Sion, Mikhail J. Atallah, Sunil Prabhakar: Rights Protection for Categorical Data. IEEE Trans. Knowl. Data Eng. 17(7): 912-926 (2005) |
141 | EE | Mikhail J. Atallah, Jiangtao Li: Secure outsourcing of sequence comparisons . Int. J. Inf. Sec. 4(4): 277-287 (2005) |
140 | EE | Robert Gwadera, Mikhail J. Atallah, Wojciech Szpankowski: Reliable detection of episodes in event sequences. Knowl. Inf. Syst. 7(4): 415-437 (2005) |
2004 | ||
139 | EE | Mikhail J. Atallah, Marina Bykova: Portable and Flexible Document Access Control Mechanisms. ESORICS 2004: 193-208 |
138 | EE | Florian Kerschbaum, Mikhail J. Atallah, David M'Raïhi, John R. Rice: Private Fingerprint Verification without Local Storage. ICBA 2004: 387-394 |
137 | EE | Radu Sion, Mikhail J. Atallah, Sunil Prabhakar: wmdb.: Rights Protection for Numeric Relational Data. ICDE 2004: 863 |
136 | EE | Mikhail J. Atallah, Robert Gwadera, Wojciech Szpankowski: Detection of Significant Sets of Episodes in Event Sequences. ICDM 2004: 3-10 |
135 | EE | Mikhail J. Atallah, Keith B. Frikken: Privacy-Preserving Location-Dependent Query Processing. ICPS 2004: 9-17 |
134 | EE | Mercan Topkara, Umut Topkara, Mikhail J. Atallah, Cüneyt M. Taskiran, Eugene T. Lin, Edward J. Delp: A hierarchical protocol for increasing the stealthiness of steganographic methods. MM&Sec 2004: 16-24 |
133 | EE | Mikhail J. Atallah, Jiangtao Li: Secure Outsourcing of Sequence Comparisons. Privacy Enhancing Technologies 2004: 63-78 |
132 | EE | Marina Bykova, Mikhail J. Atallah: Succinct specifications of portable document access policies. SACMAT 2004: 41-50 |
131 | Radu Sion, Mikhail J. Atallah: Attacking digital watermarks. Security, Steganography, and Watermarking of Multimedia Contents 2004: 848-858 | |
130 | EE | Radu Sion, Mikhail J. Atallah, Sunil Prabhakar: Resilient Rights Protection for Sensor Streams. VLDB 2004: 732-743 |
129 | EE | Mikhail J. Atallah, Marina Bykova, Jiangtao Li, Keith B. Frikken, Mercan Topkara: Private collaborative forecasting and benchmarking. WPES 2004: 103-114 |
128 | EE | Keith B. Frikken, Mikhail J. Atallah, Jiangtao Li: Hidden access control policies with hidden credentials. WPES 2004: 27 |
127 | EE | Keith B. Frikken, Mikhail J. Atallah: Privacy preserving route planning. WPES 2004: 8-15 |
126 | EE | Mikhail J. Atallah, Stefano Lonardi: Augmenting LZ-77 with authentication and integrity assurance capabilities. Concurrency - Practice and Experience 16(11): 1063-1076 (2004) |
125 | EE | Mikhail J. Atallah, Sunil Prabhakar, Keith B. Frikken, Radu Sion: Digital Rights Protection. IEEE Data Eng. Bull. 27(1): 19-25 (2004) |
124 | EE | Radu Sion, Mikhail J. Atallah, Sunil Prabhakar: Rights Protection for Relational Data. IEEE Trans. Knowl. Data Eng. 16(12): 1509-1525 (2004) |
2003 | ||
123 | EE | Mikhail J. Atallah, Jiangtao Li: Enhanced Smart-card based License Management. CEC 2003: 111-119 |
122 | EE | Mikhail J. Atallah, Hicham G. Elmongui, Vinayak Deshpande, Leroy B. Schwarz: Secure Supply-Chain Protocols. CEC 2003: 293-302 |
121 | EE | Mikhail J. Atallah, Keith B. Frikken: Replicated Parallel I/O without Additional Scheduling Costs. DEXA 2003: 223-232 |
120 | EE | Robert Gwadera, Mikhail J. Atallah, Wojciech Szpankowski: Reliable Detection of Episodes in Event Sequences. ICDM 2003: 67-74 |
119 | EE | Ioannis Ioannidis, Ananth Grama, Mikhail J. Atallah: Adaptive Data Structures for IP Lookups. INFOCOM 2003 |
118 | EE | Radu Sion, Mikhail J. Atallah, Sunil Prabhakar: On-the-fly Intrusion Detection for Web Portals. ITCC 2003: 325-330 |
117 | EE | Radu Sion, Mikhail J. Atallah, Sunil Prabhakar: Resilient Information Hiding for Abstract Semi-structures. IWDW 2003: 141-153 |
116 | Mikhail J. Atallah, Stefano Lonardi: Authentication of LZ-77 Compressed Data. SAC 2003: 282-287 | |
115 | EE | Radu Sion, Mikhail J. Atallah, Sunil Prabhakar: Rights Protection for Relational Data. SIGMOD Conference 2003: 98-109 |
114 | EE | Keith B. Frikken, Mikhail J. Atallah: Cropping-Resilient Segmented Multiple Watermarking. WADS 2003: 231-242 |
113 | EE | Mikhail J. Atallah, Florian Kerschbaum, Wenliang Du: Secure and private sequence comparisons. WPES 2003: 39-44 |
112 | EE | Keith B. Frikken, Mikhail J. Atallah: Privacy preserving electronic surveillance. WPES 2003: 45-52 |
111 | EE | Mikhail J. Atallah, Danny Z. Chen, Ovidiu Daescu: Efficient Parallel Algorithms for Planar st-Graphs. Algorithmica 35(3): 194-215 (2003) |
110 | EE | Mikhail J. Atallah, Sunil Prabhakar: (Almost) Optimal parallel block access for range queries. Inf. Sci. 157: 21-31 (2003) |
2002 | ||
109 | EE | Keith B. Frikken, Mikhail J. Atallah, Sunil Prabhakar, Reihaneh Safavi-Naini: Optimal Parallel I/O for Range Queries through Replication. DEXA 2002: 669-678 |
108 | 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 | |
107 | EE | Ioannis Ioannidis, Ananth Grama, Mikhail J. Atallah: A Secure Protocol for Computing Dot-Products in Clustered and Distributed Environments. ICPP 2002: 379-384 |
106 | EE | Radu Sion, Mikhail J. Atallah, Sunil Prabhakar: On Watermarking Numeric Sets. IWDW 2002: 130-146 |
105 | EE | 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 |
104 | EE | 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 |
103 | EE | Alberto Apostolico, Mikhail J. Atallah: Compact Recognizers of Episode Sequences. Inf. Comput. 174(2): 180-192 (2002) |
2001 | ||
102 | EE | Wenliang Du, Mikhail J. Atallah: Privacy-Preserving Cooperative Statistical Analysis. ACSAC 2001: 102-112 |
101 | EE | Wenliang Du, Mikhail J. Atallah: Privacy-Preserving Cooperative Scientific Computations. CSFW 2001: 273-294 |
100 | EE | Hoi Chang, Mikhail J. Atallah: Protecting Software Code by Guards. Digital Rights Management Workshop 2001: 160-175 |
99 | EE | 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 |
98 | EE | Wenliang Du, Mikhail J. Atallah: Secure multi-party computation problems and their applications: a review and open problems. NSPW 2001: 13-22 |
97 | EE | Mikhail J. Atallah, Wenliang Du: Secure Multi-party Computational Geometry. WADS 2001: 165-179 |
96 | Mikhail J. Atallah, K. N. Pantazopoulos, John R. Rice, Eugene H. Spafford: Secure outsourcing of scientific computations. Advances in Computers 54: 216-272 (2001) | |
95 | EE | Mikhail J. Atallah, Frédéric Chyzak, Philippe Dumas: A Randomized Algorithm for Approximate String Matching. Algorithmica 29(3): 468-486 (2001) |
94 | EE | Mikhail J. Atallah: On Estimating the Large Entries of a Convolution. IEEE Trans. Computers 50(3): 193-196 (2001) |
93 | EE | Mikhail J. Atallah: Faster image template matching in the sum of the absolute value of differences measure. IEEE Transactions on Image Processing 10(4): 659-663 (2001) |
92 | 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) | |
2000 | ||
91 | EE | Mikhail J. Atallah, Sunil Prabhakar: (Almost) Optimal Parallel Block Access for Range Queries. PODS 2000: 205-215 |
90 | EE | Chapman Flack, Mikhail J. Atallah: Better Logging through Formality. Recent Advances in Intrusion Detection 2000: 1-16 |
89 | EE | Marilyn 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) |
1999 | ||
88 | EE | Mikhail J. Atallah, Yann Génin, Wojciech Szpankowski: Pattern Matching Image Compression: Algorithmic and Empirical Results. IEEE Trans. Pattern Anal. Mach. Intell. 21(7): 614-627 (1999) |
87 | Mikhail J. Atallah: An Improved Hypercube Bound for Multisearching and Its Applications. Int. J. Comput. Geometry Appl. 9(1): 29- (1999) | |
86 | 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) | |
1998 | ||
85 | EE | Mikhail J. Atallah, Danny Z. Chen: Parallel Geometric Algorithms in Coarse-Grain Network Models. COCOON 1998: 55-64 |
84 | Mikhail J. Atallah, Douglas Comer: Algorithms for Variable Length Subnet Address Assignment. IEEE Trans. Computers 47(6): 693-699 (1998) | |
1997 | ||
83 | Mikhail J. Atallah, Danny Z. Chen, Kevin S. Klenk: Parallel algorithms for longest increasing chains in the plane and related problems. CCCG 1997 | |
82 | Mikhail J. Atallah: Efficient Parallel Algorithms for Planar st-Graphs. ISAAC 1997: 223-232 | |
1996 | ||
81 | Mikhail J. Atallah, Yann Génin, Wojciech Szpankowski: Pattern Matching Image Compression. Data Compression Conference 1996: 421 | |
80 | Mikhail J. Atallah, Danny Z. Chen: Applications of a Numbering Scheme for Polygonal Obstacles in the Plane. ISAAC 1996: 1-24 | |
79 | EE | Elias N. Houstis, Anupam Joshi, Mikhail J. Atallah, Sanjiva Weerawarana, Ahmed K. Elmagarmid: Internet, education, and the Web. WETICE 1996: 27-33 |
1995 | ||
78 | EE | Marilyn G. Andrews, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee: Parallel algorithms for maximum matching in interval graphs. IPPS 1995: 84-92 |
77 | 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) | |
76 | Mikhail J. Atallah, Andreas Fabri: On the Multisearching Problem for Hypercubes. Comput. Geom. 5: 293-302 (1995) | |
75 | Mikhail J. Atallah, Danny Z. Chen: Optimal Parallel Hypercube Algorithms for Polygon Problems. IEEE Trans. Computers 44(7): 914-922 (1995) | |
74 | 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) | |
1994 | ||
73 | Joseph Manning, Mikhail J. Atallah, Kingsley Cudjoe, Joe Lozito, Ron Pacheco: A System for Drawing Graphs with Geometric Symmetry. Graph Drawing 1994: 262-265 | |
72 | Mikhail J. Atallah, Andreas Fabri: On the Multisearching Problem of Hypercubes. PARLE 1994: 159-166 | |
71 | EE | 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 |
70 | EE | 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) |
69 | 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) | |
68 | 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) | |
1993 | ||
67 | Mikhail J. Atallah, Danny Z. Chen: On Parallel Rectilinear Obstacle-avoiding Paths. CCCG 1993: 210-215 | |
66 | 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 | |
65 | Mikhail J. Atallah, Danny Z. Chen: Optimal Parallel Hypercube Algorithms for Polygon Problems. SPDP 1993: 208-215 | |
64 | Mikhail J. Atallah, Danny Z. Chen: Computing the All-Pairs Longest Chain in the Plane. WADS 1993: 1-13 | |
63 | Mikhail J. Atallah: A Faster Parallel Algorithm for a Matrix Searching Problem. Algorithmica 9(2): 156-167 (1993) | |
62 | Mikhail J. Atallah, Danny Z. Chen: On Parallel Rectilinear Obstacle- Avoiding Paths. Comput. Geom. 3: 307-313 (1993) | |
61 | EE | 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) |
60 | Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars: Output-Sensitive Methods for Rectilinear Hidden Surface Removal Inf. Comput. 107(1): 1-24 (1993) | |
59 | Mikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich: P-complete geometric problems. Int. J. Comput. Geometry Appl. 3(4): 443-462 (1993) | |
58 | Mikhail J. Atallah, Philippe Jacquet, Wojciech Szpankowski: A Probabilistic Analysis of a Pattern Matching Problem. Random Struct. Algorithms 4(2): 191-214 (1993) | |
1992 | ||
57 | Mikhail J. Atallah, Philippe Jacquet, Wojciech Szpankowski: Pattern Matching With Mismatches: A Probabilistic Analysis and a Randomized Algorithm (Extended Abstract). CPM 1992: 27-40 | |
56 | Mikhail J. Atallah, Jyh-Jong Tsay: On the Parallel-Decomposability of Geometric Problems. Algorithmica 8(3): 209-231 (1992) | |
55 | Mikhail J. Atallah: Editor's Foreword: Special Issue on the Sixth Annual Symposium on Computational Geometry. Algorithmica 8(5&6): 343-344 (1992) | |
54 | EE | Alberto Apostolico, Mikhail J. Atallah, Susanne E. Hambrusch: New clique and independent set algorithms for circle graphs. Discrete Applied Mathematics 36(1): 1-24 (1992) |
53 | EE | Joseph Manning, Mikhail J. Atallah: Fast Detection and Display of Symmetry in Outerplanar Graphs. Discrete Applied Mathematics 39(1): 13-35 (1992) |
52 | 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) | |
51 | 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) | |
1991 | ||
50 | EE | Mikhail J. Atallah, C. Lock, Dan C. Marinescu, Howard Jay Siegel, Thomas L. Casavant: Co-scheduling compute-intensive tasks on a network of workstations: model and algorithms. ICDCS 1991: 344-352 |
49 | Mikhail J. Atallah, S. Rao Kosaraju: An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix. SODA 1991: 394-403 | |
48 | EE | 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 |
47 | Mikhail J. Atallah, Susanne E. Hambrusch, Lynn E. Te Winkel: Topological Numbering of Features on a Mesh. Algorithmica 6(5): 762-769 (1991) | |
46 | Mikhail J. Atallah, Danny Z. Chen: Parallel Rectilinear Shortest Paths with Rectangular Obstacles. Comput. Geom. 1: 79-113 (1991) | |
45 | EE | Mikhail J. Atallah, Scott McFaddin: Sequence comparison on the connection machine. Concurrency - Practice and Experience 3(2): 89-107 (1991) |
44 | EE | 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) |
43 | EE | Mikhail J. Atallah, Celso C. Ribeiro, Sérgio Lifschitz: Computing some distance functions between polygons. Pattern Recognition 24(8): 775-781 (1991) |
1990 | ||
42 | 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 | |
41 | EE | Mikhail J. Atallah, Danny Z. Chen: Parallel Rectilinear Shortest Paths with Rectangular Obstacles. SPAA 1990: 270-279 |
40 | EE | Mikhail J. Atallah, Paul B. Callahan, Michael T. Goodrich: P-Complete Geometric Problems. SPAA 1990: 317-326 |
39 | Mikhail J. Atallah: A Faster Parallel Algorithm for a Matrix Searching Problem. SWAT 1990: 192-200 | |
38 | 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) | |
37 | 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) | |
1989 | ||
36 | EE | Mikhail J. Atallah, S. Rao Kosaraju, Lawrence L. Larmore, Gary L. Miller, Shang-Hua Teng: Constructing Trees in Parallel. SPAA 1989: 421-431 |
35 | EE | Mikhail J. Atallah, Jyh-Jong Tsay: On the Parallel Decomposability of Geometric Problems. Symposium on Computational Geometry 1989: 104-113 |
34 | EE | 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 |
33 | Mikhail J. Atallah, Susanne E. Hambrusch: Optimal Channel Placement for Multi-Terminal Nets. WADS 1989: 97-114 | |
32 | Mikhail J. Atallah, S. Rao Kosaraju: An Efficient Algorithm for Maxdominance, with Applications. Algorithmica 4(2): 221-236 (1989) | |
31 | Mikhail J. Atallah, Danny Z. Chen: An Optimal Parallel Algorithm for the Minimum Circle-Cover Problem. Inf. Process. Lett. 32(4): 159-165 (1989) | |
30 | 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) | |
1988 | ||
29 | Mikhail J. Atallah, Michael T. Goodrich, S. Rao Kosaraju: Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations. AWOC 1988: 1-10 | |
28 | Mikhail J. Atallah, Michael T. Goodrich: Parallel Algorithms for Some Functions of two Convex Polygons. Algorithmica 3: 535-548 (1988) | |
27 | EE | Mikhail J. Atallah, Glenn K. Manacher, Jorge Urrutia: Finding a minimum independent dominating set in a permutation graph. Discrete Applied Mathematics 21(3): 177-183 (1988) |
26 | Mikhail J. Atallah: On Multidimensional Arrays of Processors. IEEE Trans. Computers 37(10): 1306-1309 (1988) | |
25 | 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) | |
24 | EE | S. Rao Kosaraju, Mikhail J. Atallah: Optimal simulations between mesh-connected arrays of processors. J. ACM 35(3): 635-650 (1988) |
23 | 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) | |
1987 | ||
22 | Mikhail J. Atallah, Richard Cole, Michael T. Goodrich: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms FOCS 1987: 151-160 | |
21 | Mikhail J. Atallah, Chandrajit L. Bajaj: Efficient Algorithms for Common Transversals. Inf. Process. Lett. 25(2): 87-91 (1987) | |
20 | Mikhail J. Atallah, Susanne E. Hambrusch: On Bipartite Matchings of Minimum Density. J. Algorithms 8(4): 480-502 (1987) | |
1986 | ||
19 | S. Rao Kosaraju, Mikhail J. Atallah: Optimal Simulations between Mesh-Connected Arrays of Processors (Preliminary Version) STOC 1986: 264-272 | |
18 | EE | Mikhail J. Atallah, Michael T. Goodrich: Efficient Plane Sweeping in Parallel. Symposium on Computational Geometry 1986: 216-225 |
17 | Mikhail J. Atallah, Susanne E. Hambrusch: Optimal Rotation Problems in Channel Routing. IEEE Trans. Computers 35(9): 843-847 (1986) | |
16 | Mikhail J. Atallah, Susanne E. Hambrusch: Solving Tree Problems on a Mesh-Connected Processor Array Information and Control 69(1-3): 168-187 (1986) | |
15 | Mikhail J. Atallah: Computing the Convex Hull of Line Intersections. J. Algorithms 7(2): 285-288 (1986) | |
14 | Mikhail J. Atallah, Michael T. Goodrich: Efficient Parallel Solutions to Some Geometric Problems. J. Parallel Distrib. Comput. 3(4): 492-507 (1986) | |
1985 | ||
13 | Mikhail J. Atallah, Susanne E. Hambrusch: Solving Tree Problems on a Mesh-Connected Processor Array (Preliminary Version) FOCS 1985: 222-231 | |
12 | Mikhail J. Atallah, Michael T. Goodrich: Efficient Parallel Solutions to Geometric Problems. ICPP 1985: 411-417 | |
11 | Mikhail J. Atallah, S. Rao Kosaraju: A Generalized Dictionary Machine for VLSI. IEEE Trans. Computers 34(2): 151-155 (1985) | |
10 | Mikhail J. Atallah: On Symmetry Detection. IEEE Trans. Computers 34(7): 663-666 (1985) | |
9 | Mikhail J. Atallah: A Matching Problem in the Plane. J. Comput. Syst. Sci. 31(1): 63-70 (1985) | |
1984 | ||
8 | Mikhail J. Atallah: Parallel Strong Orientation of an Undirected Graph. Inf. Process. Lett. 18(1): 37-39 (1984) | |
7 | EE | Mikhail J. Atallah, S. Rao Kosaraju: Graph Problems on a Mesh-Connected Processor Array. J. ACM 31(3): 649-667 (1984) |
6 | Mikhail J. Atallah, Uzi Vishkin: Finding Euler Tours in Parallel. J. Comput. Syst. Sci. 29(3): 330-337 (1984) | |
1983 | ||
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. Inf. Process. Lett. 17(4): 207-209 (1983) | |
1982 | ||
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) | |
1981 | ||
1 | Mikhail J. Atallah, S. Rao Kosaraju: An Adversary-Based Lower Bound for Sorting. Inf. Process. Lett. 13(2): 55-57 (1981) |