| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Susanne E. Hambrusch Dmitri V. Kalashnikov , Sunil Prabhakar , Susanne E. Hambrusch: Main Memory Evaluation of Monitoring Queries Over Moving Objects. Distributed and Parallel Databases 15 (2): 117-135 (2004) Mohamed F. Mokbel , Walid G. Aref , Susanne E. Hambrusch, Sunil Prabhakar : Towards scalable location-aware services: requirements and research issues. GIS 2003 : 110-117 Susanne E. Hambrusch, Chuan-Ming Liu : Data replication in static tree structures. Inf. Process. Lett. 86 (4): 197-202 (2003) Ashfaq A. Khokhar , Susanne E. Hambrusch, Erturk Dogan Kocalar : Termination detection in data-driven parallel computations/applications. J. Parallel Distrib. Comput. 63 (3): 312-326 (2003) Dmitri V. Kalashnikov , Sunil Prabhakar , Susanne E. Hambrusch, Walid G. Aref : Efficient Evaluation of Continuous Range Queries on Moving Objects. DEXA 2002 : 731-740 Dongyan Xu , Mohamed Hefeeda , Susanne E. Hambrusch, Bharat K. Bhargava : On Peer-to-Peer Media Streaming. ICDCS 2002 : 363-371 Frank K. H. A. Dehne , Todd Eavis , Susanne E. Hambrusch, Andrew Rau-Chaplin : Parallelizing the Data Cube. Distributed and Parallel Databases 11 (2): 181-201 (2002) Sunil Prabhakar , Yuni Xia , Dmitri V. Kalashnikov , Walid G. Aref , Susanne E. Hambrusch: Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects. IEEE Trans. Computers 51 (10): 1124-1140 (2002) Frank K. H. A. Dehne , Todd Eavis , Susanne E. Hambrusch, Andrew Rau-Chaplin : Parallelizing the Data Cube. ICDT 2001 : 129-143 Susanne E. Hambrusch, Chuan-Ming Liu , Walid G. Aref , Sunil Prabhakar : Query Processing in Broadcasted Spatial Index Trees. SSTD 2001 : 502-521 Susanne E. Hambrusch, Chuan-Ming Liu : Data Replication for External Searching in Static Tree Structures. CIKM 2000 : 360-367 Susanne E. Hambrusch, Chuan-Ming Liu , Hyeong-Seok Lim : Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees. J. Graph Algorithms Appl. 4 (4): (2000) Susanne E. Hambrusch, Hyeong-Seok Lim : Minimizing Broadcast Costs Under Edge Reductions in Tree Networks. Discrete Applied Mathematics 91 (1-3): 93-117 (1999) Susanne E. Hambrusch, Hyeong-Seok Lim : Minimizing the Diameter in Tree Networks Under Edge Reductions. Parallel Processing Letters 9 (3): 361-371 (1999) Susanne E. Hambrusch, Bruce M. Maggs : Editors' Foreword. Theory Comput. Syst. 32 (3): 211 (1999) Susanne E. Hambrusch, Ashfaq A. Khokhar , Yi Liu : Scalable S-To-P Broadcasting on Message-Passing MPPs. IEEE Trans. Parallel Distrib. Syst. 9 (8): 758-768 (1998) Susanne E. Hambrusch, Hyeong-Seok Lim : Minimizing Broadcast Costs under Edge Reductions in Tree Networks. ICPADS 1997 : 188-195 Susanne E. Hambrusch, Ashfaq A. Khokhar : Maintaining Spatial Data Sets in Distributed-Memory Machines. IPPS 1997 : 702-707 Susanne E. Hambrusch, Hung-Yi Tu : New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction. Algorithmica 17 (4): 426-448 (1997) Farooq Hameed , Susanne E. Hambrusch, Ashfaq A. Khokhar , Jamshed N. Patel : Contour ranking on coarse grained machines: a case study for low-level vision computations. Concurrency - Practice and Experience 9 (3): 203-221 (1997) Susanne E. Hambrusch, Hung-Yi Tu : Edge Weight Reduction Problems in Directed Acyclic Graphs. J. Algorithms 24 (1): 66-93 (1997) Susanne E. Hambrusch: Models for Parallel Computation. ICPP Workshop 1996 : 92-95 Susanne E. Hambrusch, Ashfaq A. Khokhar , Yi Liu : Scalable S-to-P Broadcasting on Message-Passing MPPs. ICPP, Vol. 1 1996 : 69-76 Susanne E. Hambrusch, Ashfaq A. Khokhar : C 3 : A Parallel Model for Coarse-Grained Machines. J. Parallel Distrib. Comput. 32 (2): 139-154 (1996) Susanne E. Hambrusch, Farooq Hameed , Ashfaq A. Khokhar : Communication Operations on Coarse-Grained Mesh Architectures. Parallel Computing 21 (5): 731-752 (1995) Susanne E. Hambrusch, Xin He , Russ Miller : Parallel Algorithms for Gray-Scale Digitized Picture Component Labeling on a Mesh-Connected Computer. J. Parallel Distrib. Comput. 20 (1): 56-68 (1994) Susanne E. Hambrusch, Hung-Yi Tu : New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction. ISAAC 1993 : 446-455 Susanne E. Hambrusch, Frank K. H. A. Dehne : Determining Maximum K-width-connectivity on Meshes. Comput. Geom. 3 : 91-105 (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) Greg N. Frederickson , Susanne E. Hambrusch, Hung-Yi Tu : Shortest Path Computations in Source-Deplanarized Graphs. Inf. Process. Lett. 47 (2): 71-75 (1993) Ajay K. Gupta , Susanne E. Hambrusch: Multiple Network Embedding into Hypercubes. J. Parallel Distrib. Comput. 19 (2): 73-82 (1993) Susanne E. Hambrusch, Frank K. H. A. Dehne : Determining Maximum itk-Width Connectivity on Meshes. IPPS 1992 : 234-241 Susanne E. Hambrusch, Xin He , Russ Miller : Parallel Algorithms for Gray-Scale Image Component Labeling on a Mesh-Connected Computer. SPAA 1992 : 100-108 Ajay K. Gupta , Susanne E. Hambrusch: Load balanced tree embeddings. Parallel Computing 18 (6): 595-614 (1992) Susanne E. Hambrusch, Hung-Yi Tu : New Algorithms and Approaches for 1-Dimensional Layout Compaction. New Results and New Trends in Computer Science 1991 : 152-171 Mikhail J. Atallah , Susanne E. Hambrusch, Lynn E. Te Winkel : Topological Numbering of Features on a Mesh. Algorithmica 6 (5): 762-769 (1991) Susanne E. Hambrusch, Hung-Yi Tu : A Framework for 1-D Compaction with Forbidden Region Avoidance. Comput. Geom. 1 : 203-226 (1991) Ajay K. Gupta , Susanne E. Hambrusch: Embedding Complete Binary Trees into Butterfly Networks. IEEE Trans. Computers 40 (7): 853-863 (1991) Susanne E. Hambrusch, Michael Luby : Parallel Asynchronous Connected Components in a Mesh. Inf. Process. Lett. 38 (5): 257-263 (1991) Frank K. H. A. Dehne , Susanne E. Hambrusch: Parallel Algorithms for Determining k-Width Connectivity in Binary Images. J. Parallel Distrib. Comput. 12 (1): 12-23 (1991) Mikhail J. Atallah , Susanne E. Hambrusch: Optimal Channel Placement for Multi-Terminal Nets. WADS 1989 : 97-114 Yukon Chang , Susanne E. Hambrusch, Janos Simon : On the Computational Complexity of Continuous Routing. J. Algorithms 10 (1): 86-108 (1989) Concettina Guerra , Susanne E. Hambrusch: Parallel Algorithms for Line Detection on a Mesh. J. Parallel Distrib. Comput. 6 (1): 1-19 (1989) Ajay K. Gupta , Susanne E. Hambrusch: Optimal Three-Dimensional Layouts of Complete Binary Trees. Inf. Process. Lett. 26 (2): 99-104 (1987) Mikhail J. Atallah , Susanne E. Hambrusch: On Bipartite Matchings of Minimum Density. J. Algorithms 8 (4): 480-502 (1987) Shaodi Gao , Susanne E. Hambrusch: Two-Layer Channel Routing with Vertical Uni-Length Overlap. Algorithmica 1 (2): 223-232 (1986) 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 , Susanne E. Hambrusch: Solving Tree Problems on a Mesh-Connected Processor Array (Preliminary Version) FOCS 1985 : 222-231 Susanne E. Hambrusch, Janos Simon : Solving Undirected Graph Problems on VLSI. SIAM J. Comput. 14 (3): 527-544 (1985) Susanne E. Hambrusch, Janos Simon : Lower Bounds for Solving Undirected Graph Problems on VLSI. ICALP 1983 : 292-303 Susanne E. Hambrusch: VLSI Algorithms for the Connected Component Problem. SIAM J. Comput. 12 (2): 354-365 (1983) 1 [ 24 ] 2 [ 43 ] [ 45 ] [ 48 ] [ 51 ] 3 [ 4 ] [ 5 ] [ 6 ] [ 8 ] [ 12 ] [ 17 ] [ 24 ] 4 [ 47 ] 5 [ 11 ] 6 [ 13 ] [ 21 ] [ 25 ] [ 44 ] [ 46 ] 7 [ 44 ] [ 46 ] 8 [ 23 ] 9 [ 7 ] 10 [ 10 ] 11 [ 9 ] [ 15 ] [ 19 ] [ 22 ] 12 [ 28 ] [ 33 ] 13 [ 20 ] [ 27 ] 14 [ 47 ] 15 [ 45 ] [ 48 ] [ 52 ] 16 [ 28 ] [ 29 ] [ 30 ] [ 33 ] [ 35 ] [ 37 ] [ 49 ] 17 [ 49 ] 18 [ 36 ] [ 39 ] [ 40 ] [ 41 ] 19 [ 41 ] [ 42 ] [ 43 ] [ 50 ] 20 [ 30 ] [ 37 ] 21 [ 14 ] 22 [ 38 ] 23 [ 20 ] [ 27 ] 24 [ 51 ] 25 [ 33 ] 26 [ 43 ] [ 45 ] [ 48 ] [ 51 ] [ 52 ] 27 [ 44 ] [ 46 ] 28 [ 2 ] [ 3 ] [ 11 ] 29 [ 16 ] [ 18 ] [ 23 ] [ 26 ] [ 32 ] [ 34 ] 30 [ 17 ] 31 [ 45 ] 32 [ 47 ]  ©2004 Association for Computing Machinery |
