Mikhail J. Atallah
According to our database^{1},
Mikhail J. Atallah
authored at least 224 papers
between 1981 and 2018.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 2006, "For contributions to parallel and distributed computation.".
IEEE Fellow
IEEE Fellow 1997, "For contributions to parallel algorithms in computational geometry and in combinatorics.".
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at dl.acm.org
On csauthors.net:
Bibliography
2018
Efficient and secure pattern matching with wildcards using lightweight cryptography.
Computers & Security, 2018
Strategic information revelation in collaborative design.
Advanced Engineering Informatics, 2018
2017
On approximate pattern matching with thresholds.
Inf. Process. Lett., 2017
Security and privacy risks in electronic communications: A user's assessment.
Proceedings of the 8th IEEE Annual Ubiquitous Computing, 2017
2016
Inhibiting and Detecting Offline Password Cracking Using ErsatzPasswords.
ACM Trans. Priv. Secur., 2016
Securityaware Business Process as a Service by hiding provenance.
Computer Standards & Interfaces, 2016
Similarity GroupBy operators for multidimensional relational data.
Proceedings of the 32nd IEEE International Conference on Data Engineering, 2016
2015
Enhancing Passwords Security Using Deceptive Covert Communication.
Proceedings of the ICT Systems Security and Privacy Protection, 2015
ErsatzPasswords: Ending Password Cracking and Detecting Password Leakage.
Proceedings of the 31st Annual Computer Security Applications Conference, 2015
2014
A Scheme for Collaboratively Processing Nearest Neighbor Queries in Oblivious Storage.
EAI Endorsed Trans. Collaborative Computing, 2014
2013
Incentive Alignment and Risk Perception: An Information Security Application.
IEEE Trans. Engineering Management, 2013
A lowervariance randomized algorithm for approximate string matching.
Inf. Process. Lett., 2013
Back Channels Can Be Useful!  Layering Authentication Channels to Provide Covert Communication.
Proceedings of the Security Protocols XXI, 2013
Secure and Private Outsourcing of ShapeBased Feature Extraction.
Proceedings of the Information and Communications Security  15th International Conference, 2013
2012
Efficient relaxed search in hierarchically clustered sequence datasets.
ACM Journal of Experimental Algorithmics, 2012
Efficient and Practical Approach for Private Record Linkage.
J. Data and Information Quality, 2012
Efficient Leakagefree Authentication of Trees, Graphs and Forests.
IACR Cryptology ePrint Archive, 2012
Private Outsourcing of Matrix Multiplication over Closed Semirings.
Proceedings of the SECRYPT 2012, 2012
PrivacyPreserving Business Process Outsourcing.
Proceedings of the 2012 IEEE 19th International Conference on Web Services, 2012
Secure and Efficient Outsourcing of Sequence Comparisons.
Proceedings of the Computer Security  ESORICS 2012, 2012
Leakagefree redactable signatures.
Proceedings of the Second ACM Conference on Data and Application Security and Privacy, 2012
Anonyfrag: an anonymizationbased approach for privacypreserving BPaaS.
Proceedings of the 1st International Workshop on Cloud Intelligence (colocated with VLDB 2012), 2012
2011
Asymptotically efficient algorithms for skyline probabilities of uncertain data.
ACM Trans. Database Syst., 2011
On the Complexity of Authorization in RBAC under Qualification and Security Constraints.
IEEE Trans. Dependable Sec. Comput., 2011
Guest Editors' Introduction: Software Protection.
IEEE Software, 2011
Running Max/Min Filters Using 1+o(1) Comparisons per Sample.
IEEE Trans. Pattern Anal. Mach. Intell., 2011
Pattern matching in the Hamming distance with thresholds.
Inf. Process. Lett., 2011
Secure Authenticated Comparisons.
Proceedings of the Applied Cryptography and Network Security, 2011
2010
Data Structures for Range Minimum Queries in Multidimensional Arrays.
Proceedings of the TwentyFirst Annual ACMSIAM Symposium on Discrete Algorithms, 2010
Computational Geometry for Uncertain Data  (Abstract of Keynote Talk).
Proceedings of the Frontiers in Algorithmics, 4th International Workshop, 2010
Identifying Interesting Instances for Probabilistic Skylines.
Proceedings of the Database and Expert Systems Applications, 21th International Conference, 2010
Securely outsourcing linear algebra computations.
Proceedings of the 5th ACM Symposium on Information, 2010
2009
Dynamic and Efficient Key Management for Access Hierarchies.
ACM Trans. Inf. Syst. Secur., 2009
Translationbased steganography.
Journal of Computer Security, 2009
Genuinity Signatures: Designing Signatures for Verifying 3D Object Genuinity.
Comput. Graph. Forum, 2009
Internet Addiction: Metasynthesis of 19962006 Quantitative Research.
Cyberpsy., Behavior, and Soc. Networking, 2009
Computing all skyline probabilities for uncertain data.
Proceedings of the TwentyEigth ACM SIGMODSIGACTSIGART Symposium on Principles of Database Systems, 2009
Robust Authentication Using Physically Unclonable Functions.
Proceedings of the Information Security, 12th International Conference, 2009
Efficient data structures for rangeaggregate queries on trees.
Proceedings of the Database Theory, 2009
Efficient Private Record Linkage.
Proceedings of the 25th International Conference on Data Engineering, 2009
Efficient and secure distribution of massive geospatial data.
Proceedings of the 17th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, 2009
2008
Private Information: To Reveal or not to Reveal.
ACM Trans. Inf. Syst. Secur., 2008
A treecovering problem arising in integrity of treestructured data.
Inf. Process. Lett., 2008
Internet addiction: Metasynthesis of qualitative research for the decade 19962006.
Computers in Human Behavior, 2008
Private and CheatingFree Outsourcing of Algebraic Computations.
Proceedings of the Sixth Annual Conference on Privacy, Security and Trust, 2008
Incentives and Perceptions of Information Security Risks.
Proceedings of the International Conference on Information Systems, 2008
Efficient Data Authentication in an Environment of Untrusted ThirdParty Distributors.
Proceedings of the 24th International Conference on Data Engineering, 2008
Efficient Distributed ThirdParty Data Authentication for Tree Hierarchies.
Proceedings of the 28th IEEE International Conference on Distributed Computing Systems (ICDCS 2008), 2008
Efficient PrivacyPreserving kNearest Neighbor Search.
Proceedings of the 28th IEEE International Conference on Distributed Computing Systems (ICDCS 2008), 2008
Private combinatorial group testing.
Proceedings of the 2008 ACM Symposium on Information, Computer and Communications Security, 2008
Binding software to specific native hardware in a VM environment: the puf challenge and opportunity.
Proceedings of the 1st ACM Workshop on Virtual Machine Security, 2008
2007
DiscrepancySensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2d Nearest Neighbors in Any Minkowski Metric.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007
Passwords for Everyone: Secure Mnemonicbased Accessible Authentication.
Proceedings of the 2007 USENIX Annual Technical Conference, 2007
Information hiding through errors: a confusing approach.
Proceedings of the Security, Steganography, and Watermarking of Multimedia Contents IX, 2007
Passwords decay, words endure: secure and reusable multiple password mnemonics.
Proceedings of the 2007 ACM Symposium on Applied Computing (SAC), 2007
Incorporating Temporal Capabilities in Existing Key Management Schemes.
Proceedings of the Computer Security, 2007
Efficient techniques for realizing geospatial access control.
Proceedings of the 2007 ACM Symposium on Information, Computer and Communications Security, 2007
2006
Succinct representation of flexible and privacypreserving access rights.
VLDB J., 2006
Rights Protection for Discrete Numeric Streams.
IEEE Trans. Knowl. Data Eng., 2006
AttributeBased Access Control with Hidden Policies and Hidden Credentials.
IEEE Trans. Computers, 2006
An empirical study of automatic event reconstruction systems.
Digital Investigation, 2006
Natural language watermarking: Challenges in building a practical system.
Proceedings of the Security, Steganography, and Watermarking of Multimedia Contents VIII, 2006
Key management for nontree access hierarchies.
Proceedings of the 11th ACM Symposium on Access Control Models and Technologies, 2006
Lost in just the translation.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006
Trust Negotiation with Hidden Credentials, Hidden Policies, and Policy Cycles.
Proceedings of the Network and Distributed System Security Symposium, 2006
The hiding virtues of ambiguity: quantifiably resilient watermarking of natural language text through synonym substitutions.
Proceedings of the 8th workshop on Multimedia & Security, 2006
PointBased Trust: Define How Much Privacy Is Worth.
Proceedings of the Information and Communications Security, 8th International Conference, 2006
Efficient Correlated Action Selection.
Proceedings of the Financial Cryptography and Data Security, 2006
Secure and Private Collaborative Linear Programming.
Proceedings of the 2nd International ICST Conference on Collaborative Computing: Networking, 2006
Security Issues in Collaborative Computing.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006
2005
Rights Protection for Categorical Data.
IEEE Trans. Knowl. Data Eng., 2005
A TreeBased Forward Digest Protocol to Verify Data Integrity in Distributed Media Streaming.
IEEE Trans. Knowl. Data Eng., 2005
Secure outsourcing of sequence comparisons .
Int. J. Inf. Sec., 2005
Privacypreserving credit checking.
Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC2005), 2005
Markov Models for Identification of Significant Episodes.
Proceedings of the 2005 SIAM International Conference on Data Mining, 2005
Provable bounds for portable and flexible privacypreserving access.
Proceedings of the 10th ACM Symposium on Access Control Models and Technologies, 2005
ViWiD : Visible Watermarking Based Defense Against Phishing.
Proceedings of the Digital Watermarking, 4th International Workshop, 2005
TranslationBased Steganography.
Proceedings of the Information Hiding, 7th International Workshop, 2005
Data Confidentiality in Collaborative Computing.
Proceedings of the High Performance Computing, 2005
Achieving Fairness in Private Contract Negotiation.
Proceedings of the Financial Cryptography and Data Security, 2005
Secure Biometric Authentication for Weak Computational Devices.
Proceedings of the Financial Cryptography and Data Security, 2005
Dynamic and efficient key management for access hierarchies.
Proceedings of the 12th ACM Conference on Computer and Communications Security, 2005
Remote Revocation of Smart Cards in a Private DRM System.
Proceedings of the ACSW Frontiers 2005, 2005 ACSW Workshops, 2005
A Survey of Watermarking Techniques for NonMedia Digital Objects (Invited Talk).
Proceedings of the ACSW Frontiers 2005, 2005 ACSW Workshops, 2005
Indexing Information for Data Forensics.
Proceedings of the Applied Cryptography and Network Security, 2005
2004
Digital Rights Management.
Proceedings of the Practical Handbook of Internet Computing., 2004
Digital Rights Protection.
IEEE Data Eng. Bull., 2004
Augmenting LZ77 with authentication and integrity assurance capabilities.
Concurrency  Practice and Experience, 2004
Hidden access control policies with hidden credentials.
Proceedings of the 2004 ACM Workshop on Privacy in the Electronic Society, 2004
Privacy preserving route planning.
Proceedings of the 2004 ACM Workshop on Privacy in the Electronic Society, 2004
Private collaborative forecasting and benchmarking.
Proceedings of the 2004 ACM Workshop on Privacy in the Electronic Society, 2004
Resilient Rights Protection for Sensor Streams.
Proceedings of the (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, Toronto, Canada, August 31, 2004
Attacking digital watermarks.
Proceedings of the Security, Steganography, and Watermarking of Multimedia Contents VI, 2004
Succinct specifications of portable document access policies.
Proceedings of the 9th ACM Symposium on Access Control Models and Technologies, 2004
Secure Outsourcing of Sequence Comparisons.
Proceedings of the Privacy Enhancing Technologies, 4th International Workshop, 2004
A hierarchical protocol for increasing the stealthiness of steganographic methods.
Proceedings of the 6th workshop on Multimedia & Security, 2004
PrivacyPreserving LocationDependent Query Processing.
Proceedings of the IEEE/ACS International Conference on Pervasive Services (ICPS'04), 2004
Detection of Significant Sets of Episodes in Event Sequences.
Proceedings of the 4th IEEE International Conference on Data Mining (ICDM 2004), 2004
wmdb.: Rights Protection for Numeric Relational Data.
Proceedings of the 20th International Conference on Data Engineering, 2004
Private Fingerprint Verification without Local Storage.
Proceedings of the Biometric Authentication, First International Conference, 2004
Portable and Flexible Document Access Control Mechanisms.
Proceedings of the Computer Security, 2004
2003
Efficient Parallel Algorithms for Planar stGraphs.
Algorithmica, 2003
Privacy preserving electronic surveillance.
Proceedings of the 2003 ACM Workshop on Privacy in the Electronic Society, 2003
Secure and private sequence comparisons.
Proceedings of the 2003 ACM Workshop on Privacy in the Electronic Society, 2003
Enhanced Smartcard based License Management.
Proceedings of the 2003 IEEE International Conference on Electronic Commerce (CEC 2003), 2003
Secure SupplyChain Protocols.
Proceedings of the 2003 IEEE International Conference on Electronic Commerce (CEC 2003), 2003
CroppingResilient Segmented Multiple Watermarking.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003
Rights Protection for Relational Data.
Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, 2003
Authentication of LZ77 Compressed Data.
Proceedings of the 2003 ACM Symposium on Applied Computing (SAC), 2003
Resilient Information Hiding for Abstract Semistructures.
Proceedings of the Digital Watermarking, Second International Workshop, 2003
Onthefly Intrusion Detection for Web Portals.
Proceedings of the 2003 International Symposium on Information Technology (ITCC 2003), 2003
Adaptive Data Structures for IP Lookups.
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003
Reliable Detection of Episodes in Event Sequences.
Proceedings of the 3rd IEEE International Conference on Data Mining (ICDM 2003), 2003
Replicated Parallel I/O without Additional Scheduling Costs.
Proceedings of the Database and Expert Systems Applications, 14th International Conference, 2003
2002
Compact Recognizers of Episode Sequences.
Inf. Comput., 2002
On the Discovery of Weak Periodicities in Large Time Series.
Proceedings of the Principles of Data Mining and Knowledge Discovery, 2002
On Watermarking Numeric Sets.
Proceedings of the Digital Watermarking, First International Workshop, 2002
Natural Language Watermarking and Tamperproofing.
Proceedings of the Information Hiding, 5th International Workshop, 2002
A Secure Protocol for Computing DotProducts in Clustered and Distributed Environments.
Proceedings of the 31st International Conference on Parallel Processing (ICPP 2002), 2002
Multiple and Partial Periodicity Mining in Time Series Databases.
Proceedings of the 15th Eureopean Conference on Artificial Intelligence, 2002
Optimal Parallel I/O for Range Queries through Replication.
Proceedings of the Database and Expert Systems Applications, 13th International Conference, 2002
Why NLP Should Move into IAS.
Proceedings of the A Roadmap for Computational Linguistics@COLING 2002, Taipei, Taiwan, August 24, 2002
2001
Protocols for Secure Remote Database Access with Approximate Matching.
Proceedings of the ECommerce Security and Privacy, 2001
Faster image template matching in the sum of the absolute value of differences measure.
IEEE Trans. Image Processing, 2001
On Estimating the Large Entries of a Convolution.
IEEE Trans. Computers, 2001
On Connecting Red and Blue Rectilinear Polygonal Obstacles with Nonintersecting Monotone Rectilinear Paths.
Int. J. Comput. Geometry Appl., 2001
A Randomized Algorithm for Approximate String Matching.
Algorithmica, 2001
Secure outsourcing of scientific computations.
Advances in Computers, 2001
Secure Multiparty Computational Geometry.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001
Secure multiparty computation problems and their applications: a review and open problems.
Proceedings of the New Security Paradigms Workshop 2001, 2001
Natural Language Watermarking: Design, Analysis, and a ProofofConcept Implementation.
Proceedings of the Information Hiding, 4th International Workshop, 2001
PrivacyPreserving Cooperative Scientific Computations.
Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW14 2001), 2001
Protecting Software Code by Guards.
Proceedings of the Security and Privacy in Digital Rights Management, 2001
PrivacyPreserving Cooperative Statistical Analysis.
Proceedings of the 17th Annual Computer Security Applications Conference (ACSAC 2001), 2001
2000
Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems.
Algorithmica, 2000
Better Logging through Formality.
Proceedings of the Recent Advances in Intrusion Detection, Third International Workshop, 2000
(Almost) Optimal Parallel Block Access for Range Queries.
Proceedings of the Nineteenth ACM SIGMODSIGACTSIGART Symposium on Principles of Database Systems, 2000
Natural language processing for information assurance and security: an overview and implementations.
Proceedings of the 2000 Workshop on New Security Paradigms, 2000
1999
Pattern Matching Image Compression: Algorithmic and Empirical Results.
IEEE Trans. Pattern Anal. Mach. Intell., 1999
An Improved Hypercube Bound for Multisearching and Its Applications.
Int. J. Comput. Geometry Appl., 1999
Watermarking with quadratic residues.
Proceedings of the Security and Watermarking of Multimedia Contents, 1999
Algorithms and theory of computation handbook.
CRC Press, ISBN: 0849326494, 1999
1998
Algorithms for Variable Length Subnet Address Assignment.
IEEE Trans. Computers, 1998
Parallel Geometric Algorithms in CoarseGrain Network Models.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998
1997
Efficient Parallel Algorithms for Planar stGraphs.
Proceedings of the Algorithms and Computation, 8th International Symposium, 1997
Parallel algorithms for longest increasing chains in the plane and related problems.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997
Parallel computations of Levenshtein distances.
Proceedings of the Pattern Matching Algorithms, 1997
1996
Internet, education, and the Web.
Proceedings of the 5th Workshop on Enabling Technologies, 1996
Applications of a Numbering Scheme for Polygonal Obstacles in the Plane.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996
A pattern matching approach to image compression.
Proceedings of the Proceedings 1996 International Conference on Image Processing, 1996
Pattern Matching Image Compression.
Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996
1995
Computing the allpairs longest chains in the plane.
Int. J. Comput. Geometry Appl., 1995
On the Multisearching Problem for Hypercubes.
Comput. Geom., 1995
Parallel algorithms for maximum matching in interval graphs.
Proceedings of IPPS '95, 1995
1994
A BlockBased Mode Selection Model for SIMD/SPMD Parallel Environments.
J. Parallel Distrib. Comput., 1994
Multisearch Techniques: Parallel Data Structures on MeshConnected Computers.
J. Parallel Distrib. Comput., 1994
On the Multisearching Problem of Hypercubes.
Proceedings of the PARLE '94: Parallel Architectures and Languages Europe, 1994
A System for Drawing Graphs with Geometric Symmetry.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994
Biased Finger Trees and ThreeDimensional Layers of Maxima (Preliminary Version).
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994
1993
OutputSensitive Methods for Rectilinear Hidden Surface Removal
Inf. Comput., November, 1993
A Probabilistic Analysis of a Pattern Matching Problem.
Random Struct. Algorithms, 1993
New Clique and Independent Set Algorithms for Circle Graphs (Discrete Applied Mathematics 36 (1992) 124).
Discrete Applied Mathematics, 1993
On Parallel Rectilinear Obstacle Avoiding Paths.
Comput. Geom., 1993
Computing the AllPairs Longest Chain in the Plane.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993
Optimal Parallel Hypercube Algorithms for Polygon Problems.
Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993
An Optimal Algorithm for Shortest Paths on Weighted Interval and CircularArc Graphs, with Applications.
Proceedings of the Algorithms  ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993
On Parallel Rectilinear Obstacleavoiding Paths.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993
1992
Models and Algorithms for Coscheduling ComputeIntensive Tasks on a Network of Workstations.
J. Parallel Distrib. Comput., 1992
Fast Detection and Display of Symmetry in Outerplanar Graphs.
Discrete Applied Mathematics, 1992
New clique and independent set algorithms for circle graphs.
Discrete Applied Mathematics, 1992
Editor's Foreword: Special Issue on the Sixth Annual Symposium on Computational Geometry.
Algorithmica, 1992
Pattern Matching With Mismatches: A Probabilistic Analysis and a Randomized Algorithm (Extended Abstract).
Proceedings of the Combinatorial Pattern Matching, Third Annual Symposium, 1992
1991
Computing some distance functions between polygons.
Pattern Recognition, 1991
An Optimal Parallel Algorithm for the Visibility of a Simple Polygon from a Point.
J. ACM, 1991
Sequence comparison on the connection machine.
Concurrency  Practice and Experience, 1991
Topological Numbering of Features on a Mesh.
Algorithmica, 1991
Multisearch Techniques for Implementing Data Structures on a MeshConnected Computer (Preliminary Version).
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991
An Efficient Parallel Algorithm for the Row Minima of a Totally Monotone Matrix.
Proceedings of the Second Annual ACM/SIGACTSIAM Symposium on Discrete Algorithms, 1991
Coscheduling computeintensive tasks on a network of workstations: model and algorithms.
Proceedings of the 10th International Conference on Distributed Computing Systems (ICDCS 1991), 1991
1990
Efficient Parallel Algorithms for String Editing and Related Problems.
SIAM J. Comput., 1990
On Performing Robust Order Statistics in TreeStructured Dictionary Machines.
J. Parallel Distrib. Comput., 1990
A Faster Parallel Algorithm for a Matrix Searching Problem.
Proceedings of the SWAT 90, 1990
PComplete Geometric Problems.
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990
Parallel Rectilinear Shortest Paths with Rectangular Obstacles.
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990
An InputSize/OutputSize TradeOff in the TimeComplexity of Rectilinear Hidden Surface Removal (Preliminary Version).
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990
1989
Cascading DivideandConquer: A Technique for Designing Parallel Algorithms.
SIAM J. Comput., 1989
An Optimal Parallel Algorithm for the Minimum CircleCover Problem.
Inf. Process. Lett., 1989
An Efficient Algorithm for Maxdominance, with Applications.
Algorithmica, 1989
Optimal Channel Placement for MultiTerminal Nets.
Proceedings of the Algorithms and Data Structures, 1989
Constructing Trees in Parallel.
Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989
On the Parallel Decomposability of Geometric Problems.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989
Optimal Parallel Algorithm for Visibility of a Simple Polygon from a Point.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989
1988
On Multidimensional Arrays of Processors.
IEEE Trans. Computers, 1988
Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel.
SIAM J. Comput., 1988
Optimal simulations between meshconnected arrays of processors.
J. ACM, 1988
Sorting with Efficient Use of SpecialPurpose Sorters.
Inf. Process. Lett., 1988
Finding a minimum independent dominating set in a permutation graph.
Discrete Applied Mathematics, 1988
Parallel Algorithms for Some Functions of two Convex Polygons.
Algorithmica, 1988
Parallel Algorithms for Evaluating Sequences of SetManipulation Operations.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988
1987
On Bipartite Matchings of Minimum Density.
J. Algorithms, 1987
Efficient Algorithms for Common Transversals.
Inf. Process. Lett., 1987
Cascading DivideandConquer: A Technique for Designing Parallel Algorithms
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987
1986
Optimal Rotation Problems in Channel Routing.
IEEE Trans. Computers, 1986
Efficient Parallel Solutions to Some Geometric Problems.
J. Parallel Distrib. Comput., 1986
Computing the Convex Hull of Line Intersections.
J. Algorithms, 1986
Solving Tree Problems on a MeshConnected Processor Array
Information and Control, 1986
An assignment algorithm with applications to integrated circuit layout.
Discrete Applied Mathematics, 1986
A note on finding a maximum empty rectangle.
Discrete Applied Mathematics, 1986
Optimal Simulations between MeshConnected Arrays of Processors (Preliminary Version)
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986
Efficient Plane Sweeping in Parallel.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986
1985
A Generalized Dictionary Machine for VLSI.
IEEE Trans. Computers, 1985
On Symmetry Detection.
IEEE Trans. Computers, 1985
A Matching Problem in the Plane.
J. Comput. Syst. Sci., 1985
Efficient Parallel Solutions to Geometric Problems.
Proceedings of the International Conference on Parallel Processing, 1985
Solving Tree Problems on a MeshConnected Processor Array (Preliminary Version)
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985
1984
Finding Euler Tours in Parallel.
J. Comput. Syst. Sci., 1984
Graph Problems on a MeshConnected Processor Array.
J. ACM, 1984
Parallel Strong Orientation of an Undirected Graph.
Inf. Process. Lett., 1984
Checking similarity of planar figures.
International Journal of Parallel Programming, 1984
1983
A Linear Time Algorithm for the Hausdorff Distance Between Convex Polygons.
Inf. Process. Lett., 1983
Dynamic Computational Geometry (Preliminary Version)
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983
1982
Finding the Cyclic Index of an Irreducible, Nonnegative Matrix.
SIAM J. Comput., 1982
Graph Problems on a MeshConnected Processor Array (Preliminary Version)
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982
1981
An AdversaryBased Lower Bound for Sorting.
Inf. Process. Lett., 1981