 | 2009 |
|---|
| 71 |       | Susan Horwitz,
Susan H. Rodger,
Maureen Biggers,
David Binkley,
C. Kolin Frantz,
Dawn Gundermann,
Susanne E. Hambrusch,
Steven Huss-Lederman,
Ethan V. Munson,
Barbara G. Ryder,
Monica Sweat:
Using peer-led team learning to increase participation and success of under-represented groups in introductory computer science.
SIGCSE 2009: 163-167 |
| 70 | | Susanne E. Hambrusch,
Christoph Hoffmann,
John T. Korb,
Mark Haugan,
Antony L. Hosking:
A multidisciplinary approach towards computational thinking for science majors.
SIGCSE 2009: 183-187 |
| 69 | | Owen L. Astrachan,
Susanne E. Hambrusch,
Joan Peckham,
Amber Settle:
The present and future of computational thinking.
SIGCSE 2009: 549-550 |
| 2008 |
|---|
| 68 | | Sarvjeet Singh,
Chris Mayfield,
Sagar Mittal,
Sunil Prabhakar,
Susanne E. Hambrusch,
Rahul Shah:
The Orion Uncertain Data Management System.
COMAD 2008: 273-276 |
| 67 | | Oliver Baltzer,
Frank K. H. A. Dehne,
Susanne E. Hambrusch,
Andrew Rau-Chaplin:
OLAP for Trajectories.
DEXA 2008: 340-347 |
| 66 | | Sarvjeet Singh,
Chris Mayfield,
Rahul Shah,
Sunil Prabhakar,
Susanne E. Hambrusch,
Jennifer Neville,
Reynold Cheng:
Database Support for Probabilistic Attributes and Tuples.
ICDE 2008: 1053-1061 |
| 65 | | Sarvjeet Singh,
Chris Mayfield,
Sagar Mittal,
Sunil Prabhakar,
Susanne E. Hambrusch,
Rahul Shah:
Orion 2.0: native support for uncertain data.
SIGMOD Conference 2008: 1239-1242 |
| 64 | | Sarvjeet Singh,
Chris Mayfield,
Rahul Shah,
Sunil Prabhakar,
Susanne E. Hambrusch:
Query Selectivity Estimation for Uncertain Data.
SSDBM 2008: 61-78 |
| 2007 |
|---|
| 63 | | Sarvjeet Singh,
Chris Mayfield,
Sunil Prabhakar,
Rahul Shah,
Susanne E. Hambrusch:
Indexing Uncertain Categorical Data.
ICDE 2007: 616-625 |
| 62 | | Susanne E. Hambrusch,
Chuan-Ming Liu,
Walid G. Aref,
Sunil Prabhakar:
Efficient query execution on broadcasted index tree structures.
Data Knowl. Eng. 60(3): 511-529 (2007) |
| 2006 |
|---|
| 61 | | Susanne E. Hambrusch,
Chuan-Ming Liu,
Sunil Prabhakar:
Broadcasting and querying multi-dimensional index trees in a multi-channel environment.
Inf. Syst. 31(8): 870-886 (2006) |
| 2005 |
|---|
| 60 | | Mourad Ouzzani,
Walid G. Aref,
Elisa Bertino,
Ann Christine Catlin,
Christopher W. Clifton,
Wing-Kai Hon,
Ahmed K. Elmagarmid,
Arif Ghafoor,
Susanne E. Hambrusch,
Sunil Prabhakar,
Jeffrey Scott Vitter,
Xiang Zhang:
The Indiana Center for Database Systems at Purdue University.
SIGMOD Record 34(2): 53-58 (2005) |
| 2004 |
|---|
| 59 | | Xiaopeng Xiong,
Mohamed F. Mokbel,
Walid G. Aref,
Susanne E. Hambrusch,
Sunil Prabhakar:
Scalable Spatio-temporal Continuous Query Processing for Location-aware Services.
SSDBM 2004: 317- |
| 58 | | Mohamed F. Mokbel,
Xiaopeng Xiong,
Walid G. Aref,
Susanne E. Hambrusch,
Sunil Prabhakar,
Moustafa A. Hammad:
PLACE: A Query Processor for Handling Real-time Spatio-temporal Data Streams.
VLDB 2004: 1377-1380 |
| 57 | | 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) |
| 2003 |
|---|
| 56 | | Mohamed F. Mokbel,
Walid G. Aref,
Susanne E. Hambrusch,
Sunil Prabhakar:
Towards scalable location-aware services: requirements and research issues.
GIS 2003: 110-117 |
| 55 | | Susanne E. Hambrusch,
Chuan-Ming Liu:
Data replication in static tree structures.
Inf. Process. Lett. 86(4): 197-202 (2003) |
| 54 | | 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) |
| 2002 |
|---|
| 53 | | Dmitri V. Kalashnikov,
Sunil Prabhakar,
Susanne E. Hambrusch,
Walid G. Aref:
Efficient Evaluation of Continuous Range Queries on Moving Objects.
DEXA 2002: 731-740 |
| 52 | | Dongyan Xu,
Mohamed Hefeeda,
Susanne E. Hambrusch,
Bharat K. Bhargava:
On Peer-to-Peer Media Streaming.
ICDCS 2002: 363-371 |
| 51 | | 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) |
| 50 | | 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) |
| 2001 |
|---|
| 49 | | Frank K. H. A. Dehne,
Todd Eavis,
Susanne E. Hambrusch,
Andrew Rau-Chaplin:
Parallelizing the Data Cube.
ICDT 2001: 129-143 |
| 48 | | Susanne E. Hambrusch,
Chuan-Ming Liu,
Walid G. Aref,
Sunil Prabhakar:
Query Processing in Broadcasted Spatial Index Trees.
SSTD 2001: 502-521 |
| 2000 |
|---|
| 47 | | Susanne E. Hambrusch,
Chuan-Ming Liu:
Data Replication for External Searching in Static Tree Structures.
CIKM 2000: 360-367 |
| 46 | | 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) |
| 1999 |
|---|
| 45 | | Susanne E. Hambrusch,
Hyeong-Seok Lim:
Minimizing Broadcast Costs Under Edge Reductions in Tree Networks.
Discrete Applied Mathematics 91(1-3): 93-117 (1999) |
| 44 | | Susanne E. Hambrusch,
Hyeong-Seok Lim:
Minimizing the Diameter in Tree Networks Under Edge Reductions.
Parallel Processing Letters 9(3): 361-371 (1999) |
| 43 | | Susanne E. Hambrusch,
Bruce M. Maggs:
Editors' Foreword.
Theory Comput. Syst. 32(3): 211 (1999) |
| 1998 |
|---|
| 42 | | 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) |
| 1997 |
|---|
| 41 | | Susanne E. Hambrusch,
Hyeong-Seok Lim:
Minimizing Broadcast Costs under Edge Reductions in Tree Networks.
ICPADS 1997: 188-195 |
| 40 | | Susanne E. Hambrusch,
Ashfaq A. Khokhar:
Maintaining Spatial Data Sets in Distributed-Memory Machines.
IPPS 1997: 702-707 |
| 39 |  | Susanne E. Hambrusch,
Hung-Yi Tu:
New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction.
Algorithmica 17(4): 426-448 (1997) |
| 38 | | 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) |
| 37 | | Susanne E. Hambrusch,
Hung-Yi Tu:
Edge Weight Reduction Problems in Directed Acyclic Graphs.
J. Algorithms 24(1): 66-93 (1997) |
| 1996 |
|---|
| 36 | | Susanne E. Hambrusch:
Models for Parallel Computation.
ICPP Workshop 1996: 92-95 |
| 35 | | Susanne E. Hambrusch,
Ashfaq A. Khokhar,
Yi Liu:
Scalable S-to-P Broadcasting on Message-Passing MPPs.
ICPP, Vol. 1 1996: 69-76 |
| 34 | | Susanne E. Hambrusch,
Ashfaq A. Khokhar:
C3: A Parallel Model for Coarse-Grained Machines.
J. Parallel Distrib. Comput. 32(2): 139-154 (1996) |
| 1995 |
|---|
| 33 | | Susanne E. Hambrusch,
Farooq Hameed,
Ashfaq A. Khokhar:
Communication Operations on Coarse-Grained Mesh Architectures.
Parallel Computing 21(5): 731-752 (1995) |
| 1994 |
|---|
| 32 | | 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) |
| 1993 |
|---|
| 31 | | Susanne E. Hambrusch,
Hung-Yi Tu:
New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction.
ISAAC 1993: 446-455 |
| 30 | | Susanne E. Hambrusch,
Frank K. H. A. Dehne:
Determining Maximum K-width-connectivity on Meshes.
Comput. Geom. 3: 91-105 (1993) |
| 29 | | 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) |
| 28 | | Greg N. Frederickson,
Susanne E. Hambrusch,
Hung-Yi Tu:
Shortest Path Computations in Source-Deplanarized Graphs.
Inf. Process. Lett. 47(2): 71-75 (1993) |
| 27 | | Ajay K. Gupta,
Susanne E. Hambrusch:
Multiple Network Embedding into Hypercubes.
J. Parallel Distrib. Comput. 19(2): 73-82 (1993) |
| 1992 |
|---|
| 26 | | Susanne E. Hambrusch,
Frank K. H. A. Dehne:
Determining Maximum itk-Width Connectivity on Meshes.
IPPS 1992: 234-241 |
| 25 | | Susanne E. Hambrusch,
Xin He,
Russ Miller:
Parallel Algorithms for Gray-Scale Image Component Labeling on a Mesh-Connected Computer.
SPAA 1992: 100-108 |
| 24 | | 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) |
| 23 | | Ajay K. Gupta,
Susanne E. Hambrusch:
Load balanced tree embeddings.
Parallel Computing 18(6): 595-614 (1992) |
| 1991 |
|---|
| 22 | | 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 |
| 21 | | Mikhail J. Atallah,
Susanne E. Hambrusch,
Lynn E. Te Winkel:
Topological Numbering of Features on a Mesh.
Algorithmica 6(5): 762-769 (1991) |
| 20 | | Susanne E. Hambrusch,
Hung-Yi Tu:
A Framework for 1-D Compaction with Forbidden Region Avoidance.
Comput. Geom. 1: 203-226 (1991) |
| 19 | | Ajay K. Gupta,
Susanne E. Hambrusch:
Embedding Complete Binary Trees into Butterfly Networks.
IEEE Trans. Computers 40(7): 853-863 (1991) |
| 18 | | Susanne E. Hambrusch,
Michael Luby:
Parallel Asynchronous Connected Components in a Mesh.
Inf. Process. Lett. 38(5): 257-263 (1991) |
| 17 | | 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) |
| 1990 |
|---|
| 16 | | Frank K. H. A. Dehne,
Susanne E. Hambrusch:
Parallel algorithms for determining k-width- connectivity in binary images.
SPDP 1990: 488-496 |
| 15 | | Susanne E. Hambrusch:
Report of the 21st midwest theory consortium.
SIGACT News 21(2): 30 (1990) |
| 1989 |
|---|
| 14 | | Mikhail J. Atallah,
Susanne E. Hambrusch:
Optimal Channel Placement for Multi-Terminal Nets.
WADS 1989: 97-114 |
| 13 | | Yukon Chang,
Susanne E. Hambrusch,
Janos Simon:
On the Computational Complexity of Continuous Routing.
J. Algorithms 10(1): 86-108 (1989) |
| 12 | | Concettina Guerra,
Susanne E. Hambrusch:
Parallel Algorithms for Line Detection on a Mesh.
J. Parallel Distrib. Comput. 6(1): 1-19 (1989) |
| 1987 |
|---|
| 11 | | Ajay K. Gupta,
Susanne E. Hambrusch:
Optimal Three-Dimensional Layouts of Complete Binary Trees.
Inf. Process. Lett. 26(2): 99-104 (1987) |
| 10 | | Alberto Apostolico,
Susanne E. Hambrusch:
Finding Maximum Cliques on Circular-Arc Graphs.
Inf. Process. Lett. 26(4): 209-215 (1987) |
| 9 | | Mikhail J. Atallah,
Susanne E. Hambrusch:
On Bipartite Matchings of Minimum Density.
J. Algorithms 8(4): 480-502 (1987) |
| 1986 |
|---|
| 8 | | Shaodi Gao,
Susanne E. Hambrusch:
Two-Layer Channel Routing with Vertical Uni-Length Overlap.
Algorithmica 1(2): 223-232 (1986) |
| 7 | | Mikhail J. Atallah,
Susanne E. Hambrusch:
Optimal Rotation Problems in Channel Routing.
IEEE Trans. Computers 35(9): 843-847 (1986) |
| 6 | | Mikhail J. Atallah,
Susanne E. Hambrusch:
Solving Tree Problems on a Mesh-Connected Processor Array
Information and Control 69(1-3): 168-187 (1986) |
| 1985 |
|---|
| 5 | | Mikhail J. Atallah,
Susanne E. Hambrusch:
Solving Tree Problems on a Mesh-Connected Processor Array (Preliminary Version)
FOCS 1985: 222-231 |
| 4 | | Susanne E. Hambrusch:
Channel Routing Algorithms for Overlap Models.
IEEE Trans. on CAD of Integrated Circuits and Systems 4(1): 23-30 (1985) |
| 3 | | Susanne E. Hambrusch,
Janos Simon:
Solving Undirected Graph Problems on VLSI.
SIAM J. Comput. 14(3): 527-544 (1985) |
| 1983 |
|---|
| 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) |
