| |
 |      |
                                         |
Note: Links lead to the DBLP on the Web. Susanne E. Hambrusch 45 Dmitri V. Kalashnikov , Sunil Prabhakar , Susanne E. Hambrusch, Walid G. Aref : Efficient Evaluation of Continuous Range Queries on Moving Objects. DEXA 2002 : 731-740 44 Dongyan Xu , Mohamed Hefeeda , Susanne E. Hambrusch, Bharat K. Bhargava : On Peer-to-Peer Media Streaming. ICDCS 2002 : 363-371 43 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) 42 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 Transactions on Computers 51 (10): 1124-1140 (2002) 41 Frank K. H. A. Dehne , Todd Eavis , Susanne E. Hambrusch, Andrew Rau-Chaplin : Parallelizing the Data Cube. ICDT 2001 : 129-143 40 Susanne E. Hambrusch, Chuan-Ming Liu , Walid G. Aref , Sunil Prabhakar : Query Processing in Broadcasted Spatial Index Trees. SSTD 2001 : 502-521 39 Susanne E. Hambrusch, Chuan-Ming Liu : Data Replication for External Searching in Static Tree Structures. CIKM 2000 : 360-367 38 Susanne E. Hambrusch, Bruce M. Maggs : Editors' Foreword. Theory of Computing Systems 32 (3): 211 (1999) 37 Susanne E. Hambrusch, Ashfaq A. Khokhar , Yi Liu : Scalable S-To-P Broadcasting on Message-Passing MPPs. IEEE Transactions on Parallel and Distributed Systems 9 (8): 758-768 (1998) 36 Susanne E. Hambrusch, Hyeong-Seok Lim : Minimizing Broadcast Costs under Edge Reductions in Tree Networks. ICPADS 1997 : 188-195 35 Susanne E. Hambrusch, Ashfaq A. Khokhar : Maintaining Spatial Data Sets in Distributed-Memory Machines. IPPS 1997 : 702-707 34 Susanne E. Hambrusch, Hung-Yi Tu : New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction. Algorithmica 17 (4): 426-448 (1997) 33 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) 32 Susanne E. Hambrusch, Hung-Yi Tu : Edge Weight Reduction Problems in Directed Acyclic Graphs. J. Algorithms 24 (1): 66-93 (1997) 31 Susanne E. Hambrusch: Models for Parallel Computation. ICPP Workshop 1996 : 92-95 30 Susanne E. Hambrusch, Ashfaq A. Khokhar , Yi Liu : Scalable S-to-P Broadcasting on Message-Passing MPPs. ICPP, Vol. 1 1996 : 69-76 29 Susanne E. Hambrusch, Ashfaq A. Khokhar : C 3 : A Parallel Model for Coarse-Grained Machines. Journal of Parallel and Distributed Computing 32 (2): 139-154 (1996) 28 Susanne E. Hambrusch, Farooq Hameed , Ashfaq A. Khokhar : Communication Operations on Coarse-Grained Mesh Architectures. Parallel Computing 21 (5): 731-752 (1995) 27 Susanne E. Hambrusch, Xin He , Russ Miller : Parallel Algorithms for Gray-Scale Digitized Picture Component Labeling on a Mesh-Connected Computer. Journal of Parallel and Distributed Computing 20 (1): 56-68 (1994) 26 Susanne E. Hambrusch, Hung-Yi Tu : New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction. ISAAC 1993 : 446-455 25 Susanne E. Hambrusch, Frank K. H. A. Dehne : Determining Maximum K-width-connectivity on Meshes. Computational Geometry 3 : 91-105 (1993) 24 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) 23 Greg N. Frederickson , Susanne E. Hambrusch, Hung-Yi Tu : Shortest Path Computations in Source-Deplanarized Graphs. Information Processing Letters 47 (2): 71-75 (1993) 22 Ajay K. Gupta , Susanne E. Hambrusch: Multiple Network Embedding into Hypercubes. Journal of Parallel and Distributed Computing 19 (2): 73-82 (1993) 21 Susanne E. Hambrusch, Frank K. H. A. Dehne : Determining Maximum itk-Width Connectivity on Meshes. IPPS 1992 : 234-241 20 Susanne E. Hambrusch, Xin He , Russ Miller : Parallel Algorithms for Gray-Scale Image Component Labeling on a Mesh-Connected Computer. SPAA 1992 : 100-108 19 Ajay K. Gupta , Susanne E. Hambrusch: Load balanced tree embeddings. Parallel Computing 18 (6): 595-614 (1992) 18 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 17 Mikhail J. Atallah , Susanne E. Hambrusch, Lynn E. Te Winkel : Topological Numbering of Features on a Mesh. Algorithmica 6 (5): 762-769 (1991) 16 Susanne E. Hambrusch, Hung-Yi Tu : A Framework for 1-D Compaction with Forbidden Region Avoidance. Computational Geometry 1 : 203-226 (1991) 15 Ajay K. Gupta , Susanne E. Hambrusch: Embedding Complete Binary Trees into Butterfly Networks. IEEE Transactions on Computers 40 (7): 853-863 (1991) 14 Susanne E. Hambrusch, Michael Luby : Parallel Asynchronous Connected Components in a Mesh. Information Processing Letters 38 (5): 257-263 (1991) 13 Frank K. H. A. Dehne , Susanne E. Hambrusch: Parallel Algorithms for Determining k-Width Connectivity in Binary Images. Journal of Parallel and Distributed Computing 12 (1): 12-23 (1991) 12 Mikhail J. Atallah , Susanne E. Hambrusch: Optimal Channel Placement for Multi-Terminal Nets. WADS 1989 : 97-114 11 Yukon Chang , Susanne E. Hambrusch, Janos Simon : On the Computational Complexity of Continuous Routing. J. Algorithms 10 (1): 86-108 (1989) 10 Concettina Guerra , Susanne E. Hambrusch: Parallel Algorithms for Line Detection on a Mesh. Journal of Parallel and Distributed Computing 6 (1): 1-19 (1989) 9 Ajay K. Gupta , Susanne E. Hambrusch: Optimal Three-Dimensional Layouts of Complete Binary Trees. Information Processing Letters 26 (2): 99-104 (1987) 8 Mikhail J. Atallah , Susanne E. Hambrusch: On Bipartite Matchings of Minimum Density. J. Algorithms 8 (4): 480-502 (1987) 7 Shaodi Gao , Susanne E. Hambrusch: Two-Layer Channel Routing with Vertical Uni-Length Overlap. Algorithmica 1 (2): 223-232 (1986) 6 Mikhail J. Atallah , Susanne E. Hambrusch: Optimal Rotation Problems in Channel Routing. IEEE Transactions on Computers 35 (9): 843-847 (1986) 5 Mikhail J. Atallah , Susanne E. Hambrusch: Solving Tree Problems on a Mesh-Connected Processor Array. Information and Control 69 (1-3): 168-187 (1986) 4 Mikhail J. Atallah , Susanne E. Hambrusch: Solving Tree Problems on a Mesh-Connected Processor Array (Preliminary Version). FOCS 1985 : 222-231 3 Susanne E. Hambrusch, Janos Simon : Solving Undirected Graph Problems on VLSI. SIAM J. Comput. 14 (3): 527-544 (1985) 2 Susanne E. Hambrusch, Janos Simon : Lower Bounds for Solving Undirected Graph Problems on VLSI. ICALP 1983 : 292-303 1 Susanne E. Hambrusch: VLSI Algorithms for the Connected Component Problem. SIAM J. Comput. 12 (2): 354-365 (1983)  DiSC'03 © 2003 Association for Computing Machinery |
