The following pages link to Mikhail J. Atallah (Q522962):
Displayed 50 items.
- (Q172562) (redirect page) (← links)
- On approximate pattern matching with thresholds (Q522963) (← links)
- A linear time algorithm for the Hausdorff distance between convex polygons (Q595374) (← links)
- Parallel strong orientation of an undirected graph (Q789182) (← links)
- Finding Euler tours in parallel (Q801686) (← links)
- A tree-covering problem arising in integrity of tree-structured data (Q975533) (← links)
- A matching problem in the plane (Q1064790) (← links)
- An assignment algorithm with applications to integrated circuit layout (Q1069442) (← links)
- Some dynamic computational geometry problems (Q1071526) (← links)
- A note on finding a maximum empty rectangle (Q1079570) (← links)
- Parallel algorithms for some functions of two convex polygons (Q1105374) (← links)
- An efficient algorithm for maxdominance, with applications (Q1115629) (← links)
- Finding a minimum independent dominating set in a permutation graph (Q1117255) (← links)
- An optimal parallel algorithm for the minimum circle-cover problem (Q1123605) (← links)
- An adversary-based lower bound for sorting (Q1154272) (← links)
- Topological numbering of features on a mesh (Q1175652) (← links)
- New clique and independent set algorithms for circle graphs (Q1186158) (← links)
- Parallel rectilinear shortest paths with rectangular obstacles (Q1190293) (← links)
- On the parallel-decomposability of geometric problems (Q1194344) (← links)
- Fast detection and display of symmetry in outerplanar graphs (Q1199463) (← links)
- A faster parallel algorithm for a matrix searching problem (Q1206437) (← links)
- Erratum to: New clique and independent set algorithms for circle graphs (Q1208478) (← links)
- Models and algorithms for coscheduling compute-intensive tasks on a network of workstations (Q1208582) (← links)
- On parallel rectilinear obstacle-avoiding paths (Q1314529) (← links)
- Output-sensitive methods for rectilinear hidden surface removal (Q1317431) (← links)
- Multisearch techniques: Parallel data structures on mesh-connected computers (Q1328103) (← links)
- Efficient parallel algorithms for planar \(st\)-graphs (Q1400882) (← links)
- Compact recognizers of episode sequences (Q1854526) (← links)
- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications (Q1900895) (← links)
- On the multisearching problem for hypercubes (Q1917039) (← links)
- Pattern matching in the Hamming distance with thresholds (Q1944111) (← links)
- A lower-variance randomized algorithm for approximate string matching (Q2444913) (← links)
- Secure Authenticated Comparisons (Q3011317) (← links)
- (Q3138976) (← links)
- A Generalized Dictionary Machine for VLSI (Q3219100) (← links)
- Checking similarity of planar figures (Q3219798) (← links)
- Efficient Parallel Algorithms for String Editing and Related Problems (Q3495649) (← links)
- Efficient Correlated Action Selection (Q3524147) (← links)
- Indexing Information for Data Forensics (Q3593145) (← links)
- Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric (Q3603520) (← links)
- Optimal Rotation Problems in Channel Routing (Q3731533) (← links)
- Solving tree problems on a mesh-connected processor array (Q3742734) (← links)
- Computing the convex hull of line intersections (Q3742738) (← links)
- Graph Problems on a Mesh-Connected Processor Array (Q3766876) (← links)
- (Q3795217) (← links)
- On bipartite matchings of minimum density (Q3797221) (← links)
- On multidimensional arrays of processors (Q3806840) (← links)
- Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel (Q3813294) (← links)
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms (Q3833604) (← links)
- Finding the Cyclic Index of an Irreducible, Nonnegative Matrix (Q3947138) (← links)