Susanne E. Hambrusch

发表

Expanding computer science education in schools: understanding teacher experiences and challenges

Aman Yadav, Sarah Gretter, Susanne E. Hambrusch, 2016, Comput. Sci. Educ..

Broadcasting and querying multi-dimensional index trees in a multi-channel environment

Susanne E. Hambrusch, Sunil Prabhakar, Chuan-Ming Liu, 2006, Inf. Syst..

Two-layer channel routing with vertical unit-length overlap

Susanne E. Hambrusch, Shaodi Gao, 2005, Algorithmica.

A Study of Connected Component Labeling Algorithms on the MPP

Susanne E. Hambrusch, Lynn E. Tewinkel, 1988 .

Data replication for external searching in static tree structures

Susanne E. Hambrusch, Chuan-Ming Liu, Chuan-Ming Liu, 2000, CIKM '00.

Models for Parallel Computation

Susanne E. Hambrusch, 1996, ICPP Workshop.

Scalable spatio-temporal continuous query processing for location-aware services

Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar, 2004, Proceedings. 16th International Conference on Scientific and Statistical Database Management, 2004..

Efficient query execution on broadcasted index tree structures

Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar, 2007, Data Knowl. Eng..

Computational thinking in high school courses

Susanne E. Hambrusch, Vicki H. Allan, Dennis Brylow, 2010, SIGCSE.

Multiple Network Embedding into Hypercubes

Susanne E. Hambrusch, Ajay K. Gupta, 1993, J. Parallel Distributed Comput..

A Lower Bound on Embedding Large Hypercubes into Small Hypercubes

Susanne E. Hambrusch, Naveed A. Sherwani, Ajay Gupta, 1990 .

Parallel Algorithms for Bridge- and Bi-Connectivity on Minimum Area Meshes

Susanne E. Hambrusch, 1985 .

An assignment algorithm with applications to integrated circuit layout

Mikhail J. Atallah, Susanne E. Hambrusch, 1986, Discret. Appl. Math..

Main Memory Evaluation of Monitoring Queries Over Moving Objects

Susanne E. Hambrusch, Sunil Prabhakar, Dmitri V. Kalashnikov, 2004, Distributed and Parallel Databases.

Efficient Evaluation of Continuous Range Queries on Moving Objects

Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar, 2002, DEXA.

Contour ranking on coarse grained machines: a case study for low-level vision computations

Susanne E. Hambrusch, Ashfaq A. Khokhar, J. N. Patel, 1997, Concurr. Pract. Exp..

Parallelizing the Data Cube ; LECTURE NOTES IN COMPUTER SCIENCE

Susanne E. Hambrusch, Andrew Rau-Chaplin, Frank Dehne, 2013 .

The PhD Pipeline

Susanne E. Hambrusch, Ran Libeskind-Hadas, 2015, Computer.

Generation CS

Susanne E. Hambrusch, Stuart H. Zweben, Elizabeth B. Bizot, 2017, Inroads.

New Algorithms and Approaches for 1-Dimensional Layout Compaction

Susanne E. Hambrusch, Hung-Yi Tu, Hung-Yi Tu, 1991, New Results and New Trends in Computer Science.

The present and future of computational thinking

Susanne E. Hambrusch, Amber Settle, Joan Peckham, 2009, SIGCSE '09.

S-to-P Broadcasting on Coarse-Grained Machines

Susanne E. Hambrusch, Yi Liu, Ashfaq Khokhar, 1995 .

The Orion Uncertain Data Management System

Susanne E. Hambrusch, Sunil Prabhakar, Chris Mayfield, 2008, COMAD.

Parallel algorithms for determining k-width- connectivity in binary images

Susanne E. Hambrusch, Frank Dehne, 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

PLACE: A Query Processor for Handling Real-time Spatio-temporal Data Streams

Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar, 2004, VLDB.

The role of models, software tools, and applications in high performance computing

Susanne E. Hambrusch, Edward J. Delp, Leah H. Jamieson, 1994 .

Generation CS

Susanne E. Hambrusch, Stuart H. Zweben, Elizabeth B. Bizot, 2017, Inroads.

C/sup 3/: an architecture-independent model for coarse-grained parallel machines

Susanne E. Hambrusch, Ashfaq A. Khokhar, A. Khokhar, 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

Orion 2.0: native support for uncertain data

Susanne E. Hambrusch, Sunil Prabhakar, Chris Mayfield, 2008, SIGMOD Conference.

C3: A Parallel Model for Coarse-Grained Machines

Susanne E. Hambrusch, Ashfaq A. Khokhar, A. Khokhar, 1996, J. Parallel Distributed Comput..

Topological numbering of features on a mesh

Mikhail J. Atallah, Susanne E. Hambrusch, Lynn E. Te Winkel, 2005, Algorithmica.

Maintaining spatial data sets in distributed-memory machines

Susanne E. Hambrusch, Ashfaq A. Khokhar, A. Khokhar, 1997, Proceedings 11th International Parallel Processing Symposium.

Report of the 21st midwest theory consortium

Susanne E. Hambrusch, 1990, SIGA.

Scalable S-to-P broadcasting on message-passing MPPs

Yi Liu, Susanne E. Hambrusch, Ashfaq A. Khokhar, 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.

Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects

Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar, 2002, IEEE Trans. Computers.

Query Processing in Broadcasted Spatial Index Trees

Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar, 2001, SSTD.

Load balanced tree embeddings

Susanne E. Hambrusch, Ajay K. Gupta, Ajay K. Gupta, 1992, Parallel Comput..

Parallel scalable libraries and algorithms for computer vision

Susanne E. Hambrusch, Gregory W. Cook, Edward J. Delp, 1994, Proceedings of the 12th IAPR International Conference on Pattern Recognition, Vol. 2 - Conference B: Computer Vision & Image Processing. (Cat. No.94CH3440-5).

OLAP for Trajectories ; LECTURE NOTES IN COMPUTER SCIENCE

Susanne E. Hambrusch, Andrew Rau-Chaplin, Frank Dehne, 2013 .

Data replication in static tree structures

Susanne E. Hambrusch, Chuan-Ming Liu, Chuan-Ming Liu, 2003, Inf. Process. Lett..

Minimizing the Diameter in Tree Networks Under Edge Reductions

Susanne E. Hambrusch, Hyeong-Seok Lim, 1999, Parallel Process. Lett..

VLSI Algorithms for the Connected Component Problem and its Verification Problem

Susanne E. Hambrusch, 1981, International Workshop on Graph-Theoretic Concepts in Computer Science.

Generation CS

Susanne E. Hambrusch, Stuart H. Zweben, Elizabeth B. Bizot, 2017, Inroads.

A Framework for 1-D Compaction with Forbidden Region Avoidance

Susanne E. Hambrusch, Hung-Yi Tu, 1991, Comput. Geom..

VLSI Algorithms for the Connected Component Problem

Susanne E. Hambrusch, 1983, SIAM J. Comput..

Parallel Algorithms for Determining k-Width Connectivity in Binary Images

Susanne E. Hambrusch, Frank Dehne, 1991, J. Parallel Distributed Comput..

Database Support for Probabilistic Attributes and Tuples

Susanne E. Hambrusch, Sunil Prabhakar, Reynold Cheng, 2008, 2008 IEEE 24th International Conference on Data Engineering.

Optimal Channel Placement for Multi-Terminal Nets

Mikhail J. Atallah, Susanne E. Hambrusch, 1989, WADS.

Challenges of a Computer Science Classroom: Initial Perspectives from Teachers

Aman Yadav, Sarah Gretter, Susanne E. Hambrusch, 2015, WiPSCE.

New Clique and Independent Set Algorithms for Circle Graphs (Discrete Applied Mathematics 36 (1992) 1-24)

Mikhail J. Atallah, Susanne E. Hambrusch, Alberto Apostolico, 1993, Discret. Appl. Math..

Parallel Asynchronous Connected Components in a Mesh

Susanne E. Hambrusch, Michael Luby, 1991, Inf. Process. Lett..

Channel Routing Algorithms for Overlap Models

Susanne E. Hambrusch, 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

Minimizing broadcast costs under edge reductions in tree networks

Susanne E. Hambrusch, Hyeong-Seok Lim, 1997, Proceedings 1997 International Conference on Parallel and Distributed Systems.

A multidisciplinary approach towards computational thinking for science majors

Susanne E. Hambrusch, Christoph Hoffmann, Antony L. Hosking, 2009, SIGCSE '09.

Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees

Susanne E. Hambrusch, Chuan-Ming Liu, Hyeong-Seok Lim, 2000, J. Graph Algorithms Appl..

Editors' Foreword

Bruce M. Maggs, Susanne E. Hambrusch, 1999, Theory of Computing Systems.

Communication Operations on Coarse-Grained Mesh Architectures

Susanne E. Hambrusch, Ashfaq A. Khokhar, Farooq Hameed, 1995, Parallel Comput..

Broadcasting and blocking large data sets with an index tree

Susanne E. Hambrusch, Chuan-Ming Liu, 2002 .

Finding Maximum Cliques on Circular-Arc Graphs

Susanne E. Hambrusch, Alberto Apostolico, A. Apostolico, 1987, Inf. Process. Lett..

Parallel Algorithms for Gray-Scale Digitized Picture Component Labeling on a Mesh-Connected Computer

Xin He, Susanne E. Hambrusch, Russ Miller, 1994, J. Parallel Distributed Comput..

Minimizing Broadcast Costs Under Edge Reductions in Tree Networks

Susanne E. Hambrusch, Hyeong-Seok Lim, 1999, Discret. Appl. Math..

Solving Tree Problems on a Mesh-Connected Processor Array (Preliminary Version)

Mikhail J. Atallah, Susanne E. Hambrusch, 1985, FOCS.

Optimal Rotation Problems in Channel Routing

Mikhail J. Atallah, Susanne E. Hambrusch, 1986, IEEE Transactions on Computers.

Minimizing total wire length during 1-dimensional compaction

Susanne E. Hambrusch, Hung-Yi Tu, Hung-Yi Tu, 1992, Integr..

The Indiana Center for Database Systems at Purdue University

Chris Clifton, Elisa Bertino, Xiang Zhang, 2005, SGMD.

Embedding Complete Binary Trees into Butterfly Networks

Susanne E. Hambrusch, Ajay K. Gupta, 1991, IEEE Trans. Computers.

On Bipartite Matchings of Minimum Density

Mikhail J. Atallah, Susanne E. Hambrusch, 1987, J. Algorithms.

Using peer-led team learning to increase participation and success of under-represented groups in introductory computer science

Susanne E. Hambrusch, Susan H. Rodger, Ethan V. Munson, 2009, SIGCSE '09.

Solving tree problems on a mesh-connected processor array

Mikhail J. Atallah, Susanne E. Hambrusch, 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

Termination detection in data-driven parallel computations/applications

Susanne E. Hambrusch, Ashfaq A. Khokhar, Erturk Dogan Kocalar, 2003, J. Parallel Distributed Comput..

Gender demographics trends and changes in U.S. CS departments

Susanne E. Hambrusch, Jennifer Neville, Douglas Baumann, 2011, CACM.

Towards scalable location-aware services: requirements and research issues

Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar, 2003, GIS '03.

Scalable S-To-P Broadcasting on Message-Passing MPPs

Yi Liu, Susanne E. Hambrusch, Ashfaq A. Khokhar, 1998, IEEE Trans. Parallel Distributed Syst..

New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction

Susanne E. Hambrusch, Hung-Yi Tu, 1993, ISAAC.

On the Computational Complexity of Continuous Routing

Susanne E. Hambrusch, Yukon Chang, Janos Simon, 1989, J. Algorithms.

Parallel Algorithms for Line Detection on a Mesh

Susanne E. Hambrusch, Concettina Guerra, 1989, J. Parallel Distributed Comput..

The Importance of Computing Education Research pdf

Jeffrey Forbes, Susanne E. Hambrusch, Armando Fox, 2016, ArXiv.

Understanding the U.S. domestic computer science Ph.D. pipeline

Susanne E. Hambrusch, Ran Libeskind-Hadas, Eric Aaron, 2015, Commun. ACM.

Parallel Heuristics for Determining Steiner Trees in Images

Susanne E. Hambrusch, Lynn E. Tewinkel, 1990 .

Parallel algorithms for gray-scale image component labeling on a mesh-connected computer

Xin He, Susanne E. Hambrusch, Russ Miller, 1992, SPAA '92.

Shortest Path Computations in Source-Deplanarized Graphs

Susanne E. Hambrusch, Greg N. Frederickson, Hung-Yi Tu, 1993, Inf. Process. Lett..

On peer-to-peer media streaming

Bharat K. Bhargava, Susanne E. Hambrusch, Dongyan Xu, 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

Indexing Uncertain Categorical Data

Susanne E. Hambrusch, Sunil Prabhakar, Chris Mayfield, 2007, 2007 IEEE 23rd International Conference on Data Engineering.

Contour Ranking on Coarse Grained Machines: A Case Study for Low-Level Vision Computations

Susanne E. Hambrusch, Ashfaq Khokhar, Farooq Hameed, 1997 .

Computational Thinking in Elementary and Secondary Teacher Education

Aman Yadav, Susanne E. Hambrusch, Chris Mayfield, 2014, ACM Trans. Comput. Educ..

Edge Weight Reduction Problems in Directed Acyclic Graphs

Susanne E. Hambrusch, Hung-Yi Tu, Hung-Yi Tu, 1997, J. Algorithms.

A framework for 1-D compaction with forbidden region avoidance (VLSI layout)

Susanne E. Hambrusch, Hung-Yi Tu, Hung-Yi Tu, 1991, [1991] Proceedings. First Great Lakes Symposium on VLSI.

Solving Undirected Graph Problems on VLSI

Susanne E. Hambrusch, Janos Simon, 1985, SIAM J. Comput..

New clique and independent set algorithms for circle graphs

Mikhail J. Atallah, Susanne E. Hambrusch, Alberto Apostolico, 1992, Discret. Appl. Math..

New algorithms for minimizing the longest wire length during circuit compaction

Susanne E. Hambrusch, Hung-Yi Tu, Hung-Yi Tu, 1993, Algorithmica.

Determining maximum k-width-connectivity on meshes

Susanne E. Hambrusch, Frank Dehne, 1992, Proceedings Sixth International Parallel Processing Symposium.

Exploring the Baccalaureate Origin of Domestic Ph.D. Students in Computing Fields

Susanne E. Hambrusch, Ran Libeskind-Hadas, Valerie Taylor, 2013 .

Determining Maximum K-width-connectivity on Meshes

Susanne E. Hambrusch, Frank Dehne, 1993, Comput. Geom..

Query Selectivity Estimation for Uncertain Data

Susanne E. Hambrusch, Sunil Prabhakar, Chris Mayfield, 2008, SSDBM.

Teaching Computational Thinking to Science Majors

Susanne E. Hambrusch, John T. Korb, C. Hoffmann, 2008 .

The complexity of graph problems on vlsi

Susanne E. Hambrusch, 1982 .

Query Selectivity Estimation for Uncertain Database

Susanne E. Hambrusch, S. Prabhakar, Sarvjeet Singh, 2013 .

A multidisciplinary approach towards computational thinking for science majors

Susanne E. Hambrusch, John T. Korb, C. Hoffmann, 2009, SIGCSE.

I-D Compaction in the Presence of Forbidden Regions

Susanne E. Hambrusch, Hung-Yi Tu, 2013 .

1-D Compaction

Susanne E. Hambrusch, Hung-Yi Tu, 1990 .

A Lower Bound on Embedding Tree Machines with Balanced Processor Utilization

Susanne E. Hambrusch, Ajay K. Gupta, 1988 .

Multiple Network Embeddings into Hypercubes

Susanne E. Hambrusch, Ajay K. Gupta, 1989 .

Planar linear arrangements of outerplanar graphs

Susanne E. Hambrusch, Greg N. Frederickson, G. Frederickson, 1988 .

Optimal Three-Dimensional Layouts of Complete Binary Trees

Susanne E. Hambrusch, Ajay K. Gupta, 1987, Inf. Process. Lett..

On the relationship between parallel computation and graph embeddings

Susanne E. Hambrusch, Ajay K. Gupta, 1989 .

Parallel algorithms for line detection on a mesh

Susanne E. Hambrusch, Susanne E. Hambrusch, Concettina Guerra, 1989 .

A Lower Bound on Embedding Large Hypercubesinto Small

Susanne E. Hambrusch, HypercubesAjay, K. Gupta, 1990 .

Teachers’ Perceptions of Student Misconceptions in Introductory Programming

Susanne E. Hambrusch, Aman Yadav, Sarah Gretter, 2020, Journal of educational computing research.

Who Needs What: Recommendations for Designing Effective Online Professional Development for Computer Science Teachers

Aman Yadav, Sarah Gretter, Susanne E. Hambrusch, 2018 .

Parallelizing the Data Cube

Susanne E. Hambrusch, Susanne E. Hambrusch, Andrew Rau-Chaplin, 2001, Distributed and Parallel Databases.

Information Management in a Ubiquitous Global Postioning Environment

Walid G. Aref, Susanne E. Hambrusch, Susanne E. Hambrusch, 2000 .

Introducing computational thinking in education courses

Susanne E. Hambrusch, Chris Mayfield, Ninger Zhou, 2011, SIGCSE.

Forging a Path: Faculty Interviews on the Present and Future of Computer Science Education in the United States

Susanne E. Hambrusch, Stephanie J. Lunn, Aman Yadav, 2022, ACM Trans. Comput. Educ..

Equitable Learning Environments in K-12 Computing

Aman Yadav, Sarah Gretter, Susanne E. Hambrusch, 2019, ACM Trans. Comput. Educ..

Models for Parallel Computation

Susanne E. Hambrusch, 1996, ICPP Workshop.

Multiple Network Embedding into Hybercubes

Susanne E. Hambrusch, Ajay Gupta, Ajay K. Gupta, 1990, Proceedings of the Fifth Distributed Memory Computing Conference, 1990..