default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSusanne E. Hambrusch
Person information
- affiliation: Purdue University, West Lafayette, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j54]Stephanie Lunn
, Maíra Marques Samary, Susanne E. Hambrusch, Aman Yadav:
Forging a Path: Faculty Interviews on the Present and Future of Computer Science Education in the United States. ACM Trans. Comput. Educ. 22(4): 51:1-51:24 (2022)- 2020
- [c38]Susanne E. Hambrusch, Alan Peterfreund, Aman Yadav, Amy J. Ko:
Graduate Programs in CS Education: Why 2020 is the Right Time. SIGCSE 2020: 1407
2010 – 2019
- 2019
- [j53]Sarah Gretter, Aman Yadav, Phil Sands, Susanne E. Hambrusch:
Equitable Learning Environments in K-12 Computing: Teachers' Views on Barriers to Diversity. ACM Trans. Comput. Educ. 19(3): 24:1-24:16 (2019) - 2017
- [j52]Aman Yadav, Sarah Gretter, Susanne E. Hambrusch, Phil Sands:
Expanding computer science education in schools: understanding teacher experiences and challenges. Comput. Sci. Educ. 26(4): 235-254 (2017) - [j51]Tracy Camp, W. Richards Adrion, Elizabeth B. Bizot, Susan B. Davidson, Mary W. Hall, Susanne E. Hambrusch, Ellen Walker, Stuart H. Zweben:
Generation CS: the growth of computer science. Inroads 8(2): 44-50 (2017) - [j50]Tracy Camp, W. Richards Adrion, Elizabeth B. Bizot, Susan B. Davidson, Mary W. Hall, Susanne E. Hambrusch, Ellen Walker, Stuart H. Zweben:
Generation CS: the mixed news on diversity and the enrollment surge. Inroads 8(3): 36-42 (2017) - [j49]Tracy Camp, W. Richards Adrion, Elizabeth B. Bizot, Susan B. Davidson, Mary W. Hall, Susanne E. Hambrusch, Ellen Walker, Stuart H. Zweben:
Generation CS: the challenges of and responses to the enrollment surge. Inroads 8(4): 59-65 (2017) - 2016
- [i1]Steve Cooper, Jeffrey Forbes, Armando Fox, Susanne E. Hambrusch, Amy J. Ko, Beth Simon:
The Importance of Computing Education Research. CoRR abs/1604.03446 (2016) - 2015
- [j48]Susanne E. Hambrusch, Ran Libeskind-Hadas, Eric Aaron:
Understanding the U.S. domestic computer science Ph.D. pipeline. Commun. ACM 58(8): 29-32 (2015) - [j47]Susanne E. Hambrusch, Ran Libeskind-Hadas:
The PhD Pipeline. Computer 48(5): 76-79 (2015) - [c37]Aman Yadav, Sarah Gretter, Susanne E. Hambrusch:
Challenges of a Computer Science Classroom: Initial Perspectives from Teachers. WiPSCE 2015: 136-137 - 2014
- [j46]Aman Yadav, Chris Mayfield, Ninger Zhou, Susanne E. Hambrusch, John T. Korb:
Computational Thinking in Elementary and Secondary Teacher Education. ACM Trans. Comput. Educ. 14(1): 5:1-5:16 (2014) - 2011
- [j45]Douglas Baumann, Susanne E. Hambrusch, Jennifer Neville:
Gender demographics trends and changes in U.S. CS departments. Commun. ACM 54(11): 38-42 (2011) - [c36]Aman Yadav, Ninger Zhou, Chris Mayfield, Susanne E. Hambrusch, John T. Korb:
Introducing computational thinking in education courses. SIGCSE 2011: 465-470 - 2010
- [c35]Vicki H. Allan, Valerie Barr, Dennis Brylow, Susanne E. Hambrusch:
Computational thinking in high school courses. SIGCSE 2010: 390-391
2000 – 2009
- 2009
- [c34]Susan Horwitz, Susan H. Rodger, Maureen Biggers, David W. 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 - [c33]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 - [c32]Owen L. Astrachan, Susanne E. Hambrusch, Joan Peckham, Amber Settle:
The present and future of computational thinking. SIGCSE 2009: 549-550 - 2008
- [c31]Sarvjeet Singh, Chris Mayfield, Sagar Mittal, Sunil Prabhakar, Susanne E. Hambrusch, Rahul Shah:
The Orion Uncertain Data Management System. COMAD 2008: 273-276 - [c30]Oliver Baltzer, Frank K. H. A. Dehne, Susanne E. Hambrusch, Andrew Rau-Chaplin:
OLAP for Trajectories. DEXA 2008: 340-347 - [c29]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 - [c28]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 - [c27]Sarvjeet Singh, Chris Mayfield, Rahul Shah, Sunil Prabhakar, Susanne E. Hambrusch:
Query Selectivity Estimation for Uncertain Data. SSDBM 2008: 61-78 - 2007
- [j44]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) - [c26]Sarvjeet Singh, Chris Mayfield, Sunil Prabhakar, Rahul Shah, Susanne E. Hambrusch:
Indexing Uncertain Categorical Data. ICDE 2007: 616-625 - 2006
- [j43]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
- [j42]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 Rec. 34(2): 53-58 (2005) - 2004
- [j41]Dmitri V. Kalashnikov, Sunil Prabhakar, Susanne E. Hambrusch:
Main Memory Evaluation of Monitoring Queries Over Moving Objects. Distributed Parallel Databases 15(2): 117-135 (2004) - [c25]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-326 - [c24]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 - 2003
- [j40]Susanne E. Hambrusch, Chuan-Ming Liu:
Data replication in static tree structures. Inf. Process. Lett. 86(4): 197-202 (2003) - [j39]Ashfaq A. Khokhar, Susanne E. Hambrusch, Erturk Dogan Kocalar:
Termination detection in data-driven parallel computations/applications. J. Parallel Distributed Comput. 63(3): 312-326 (2003) - [c23]Mohamed F. Mokbel, Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar:
Towards scalable location-aware services: requirements and research issues. GIS 2003: 110-117 - 2002
- [j38]Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambrusch, Andrew Rau-Chaplin:
Parallelizing the Data Cube. Distributed Parallel Databases 11(2): 181-201 (2002) - [j37]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) - [c22]Dmitri V. Kalashnikov, Sunil Prabhakar, Susanne E. Hambrusch, Walid G. Aref:
Efficient Evaluation of Continuous Range Queries on Moving Objects. DEXA 2002: 731-740 - [c21]Dongyan Xu, Mohamed Hefeeda, Susanne E. Hambrusch, Bharat K. Bhargava:
On Peer-to-Peer Media Streaming. ICDCS 2002: 363-371 - 2001
- [c20]Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambrusch, Andrew Rau-Chaplin:
Parallelizing the Data Cube. ICDT 2001: 129-143 - [c19]Susanne E. Hambrusch, Chuan-Ming Liu, Walid G. Aref, Sunil Prabhakar:
Query Processing in Broadcasted Spatial Index Trees. SSTD 2001: 502-521 - 2000
- [j36]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): 1-26 (2000) - [c18]Susanne E. Hambrusch, Chuan-Ming Liu:
Data Replication for External Searching in Static Tree Structures. CIKM 2000: 360-367
1990 – 1999
- 1999
- [j35]Susanne E. Hambrusch, Hyeong-Seok Lim:
Minimizing Broadcast Costs Under Edge Reductions in Tree Networks. Discret. Appl. Math. 91(1-3): 93-117 (1999) - [j34]Susanne E. Hambrusch, Bruce M. Maggs:
Editors' Foreword. Theory Comput. Syst. 32(3): 211 (1999) - [j33]Susanne E. Hambrusch, Hyeong-Seok Lim:
Minimizing the Diameter in Tree Networks Under Edge Reductions. Parallel Process. Lett. 9(3): 361-371 (1999) - 1998
- [j32]Susanne E. Hambrusch, Ashfaq A. Khokhar, Yi Liu:
Scalable S-To-P Broadcasting on Message-Passing MPPs. IEEE Trans. Parallel Distributed Syst. 9(8): 758-768 (1998) - 1997
- [j31]Susanne E. Hambrusch, Hung-Yi Tu:
New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction. Algorithmica 17(4): 426-448 (1997) - [j30]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. Concurr. Pract. Exp. 9(3): 203-221 (1997) - [j29]Susanne E. Hambrusch, Hung-Yi Tu:
Edge Weight Reduction Problems in Directed Acyclic Graphs. J. Algorithms 24(1): 66-93 (1997) - [c17]Susanne E. Hambrusch, Hyeong-Seok Lim:
Minimizing Broadcast Costs under Edge Reductions in Tree Networks. ICPADS 1997: 188-195 - [c16]Susanne E. Hambrusch, Ashfaq A. Khokhar:
Maintaining Spatial Data Sets in Distributed-Memory Machines. IPPS 1997: 702-707 - 1996
- [j28]Susanne E. Hambrusch, Ashfaq A. Khokhar:
C3: A Parallel Model for Coarse-Grained Machines. J. Parallel Distributed Comput. 32(2): 139-154 (1996) - [c15]Susanne E. Hambrusch, Ashfaq A. Khokhar, Yi Liu:
Scalable S-to-P Broadcasting on Message-Passing MPPs. ICPP, Vol. 1 1996: 69-76 - [c14]Susanne E. Hambrusch:
Models for Parallel Computation. ICPP Workshop 1996: 92-95 - 1995
- [j27]Susanne E. Hambrusch, Farooq Hameed, Ashfaq A. Khokhar:
Communication Operations on Coarse-Grained Mesh Architectures. Parallel Comput. 21(5): 731-752 (1995) - 1994
- [j26]Susanne E. Hambrusch, Xin He, Russ Miller:
Parallel Algorithms for Gray-Scale Digitized Picture Component Labeling on a Mesh-Connected Computer. J. Parallel Distributed Comput. 20(1): 56-68 (1994) - [c13]Leah H. Jamieson, Edward J. Delp, Susanne E. Hambrusch, Ashfaq A. Khokhar, Gregory W. Cook, Farooq Hameed, Jamshed N. Patel, Ke Shen:
Parallel scalable libraries and algorithms for computer vision. ICPR (3) 1994: 223-228 - [c12]Susanne E. Hambrusch, Ashfaq A. Khokhar:
C3: an architecture-independent model for coarse-grained parallel machines. SPDP 1994: 544-551 - 1993
- [j25]Susanne E. Hambrusch, Frank K. H. A. Dehne:
Determining Maximum K-width-connectivity on Meshes. Comput. Geom. 3: 91-105 (1993) - [j24]Alberto Apostolico, Mikhail J. Atallah, Susanne E. Hambrusch:
New Clique and Independent Set Algorithms for Circle Graphs (Discrete Applied Mathematics 36 (1992) 1-24). Discret. Appl. Math. 41(2): 179-180 (1993) - [j23]Greg N. Frederickson, Susanne E. Hambrusch, Hung-Yi Tu:
Shortest Path Computations in Source-Deplanarized Graphs. Inf. Process. Lett. 47(2): 71-75 (1993) - [j22]Ajay K. Gupta, Susanne E. Hambrusch:
Multiple Network Embedding into Hypercubes. J. Parallel Distributed Comput. 19(2): 73-82 (1993) - [c11]Susanne E. Hambrusch, Hung-Yi Tu:
New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction. ISAAC 1993: 446-455 - 1992
- [j21]Alberto Apostolico, Mikhail J. Atallah, Susanne E. Hambrusch:
New clique and independent set algorithms for circle graphs. Discret. Appl. Math. 36(1): 1-24 (1992) - [j20]Susanne E. Hambrusch, Hung-Yi Tu:
Minimizing total wire length during 1-dimensional compaction. Integr. 14(2): 113-144 (1992) - [j19]Ajay K. Gupta, Susanne E. Hambrusch:
Load balanced tree embeddings. Parallel Comput. 18(6): 595-614 (1992) - [c10]Susanne E. Hambrusch, Frank K. H. A. Dehne:
Determining Maximum itk-Width Connectivity on Meshes. IPPS 1992: 234-241 - [c9]Susanne E. Hambrusch, Xin He, Russ Miller:
Parallel Algorithms for Gray-Scale Image Component Labeling on a Mesh-Connected Computer. SPAA 1992: 100-108 - 1991
- [j18]Mikhail J. Atallah, Susanne E. Hambrusch, Lynn E. Te Winkel:
Topological Numbering of Features on a Mesh. Algorithmica 6(5): 762-769 (1991) - [j17]Susanne E. Hambrusch, Hung-Yi Tu:
A Framework for 1-D Compaction with Forbidden Region Avoidance. Comput. Geom. 1: 203-226 (1991) - [j16]Susanne E. Hambrusch, Michael Luby:
Parallel Asynchronous Connected Components in a Mesh. Inf. Process. Lett. 38(5): 257-263 (1991) - [j15]Frank K. H. A. Dehne, Susanne E. Hambrusch:
Parallel Algorithms for Determining k-Width Connectivity in Binary Images. J. Parallel Distributed Comput. 12(1): 12-23 (1991) - [j14]Ajay K. Gupta, Susanne E. Hambrusch:
Embedding Complete Binary Trees into Butterfly Networks. IEEE Trans. Computers 40(7): 853-863 (1991) - [c8]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 - [c7]Susanne E. Hambrusch, Hung-Yi Tu:
A framework for 1-D compaction with forbidden region avoidance [VLSI layout]. Great Lakes Symposium on VLSI 1991: 146-151 - 1990
- [j13]Susanne E. Hambrusch:
Report of the 21st midwest theory consortium. SIGACT News 21(2): 30 (1990) - [c6]Susanne E. Hambrusch, Lynn TeWinkel:
Parallel heuristics for the Steiner tree problem in images without sorting or routing. ICPR (2) 1990: 356-361 - [c5]Frank K. H. A. Dehne, Susanne E. Hambrusch:
Parallel algorithms for determining k-width- connectivity in binary images. SPDP 1990: 488-496
1980 – 1989
- 1989
- [j12]Yukon Chang, Susanne E. Hambrusch, Janos Simon:
On the Computational Complexity of Continuous Routing. J. Algorithms 10(1): 86-108 (1989) - [j11]Concettina Guerra, Susanne E. Hambrusch:
Parallel Algorithms for Line Detection on a Mesh. J. Parallel Distributed Comput. 6(1): 1-19 (1989) - [c4]Mikhail J. Atallah, Susanne E. Hambrusch:
Optimal Channel Placement for Multi-Terminal Nets. WADS 1989: 97-114 - 1987
- [j10]Ajay K. Gupta, Susanne E. Hambrusch:
Optimal Three-Dimensional Layouts of Complete Binary Trees. Inf. Process. Lett. 26(2): 99-104 (1987) - [j9]Alberto Apostolico, Susanne E. Hambrusch:
Finding Maximum Cliques on Circular-Arc Graphs. Inf. Process. Lett. 26(4): 209-215 (1987) - [j8]Mikhail J. Atallah, Susanne E. Hambrusch:
On Bipartite Matchings of Minimum Density. J. Algorithms 8(4): 480-502 (1987) - 1986
- [j7]Shaodi Gao, Susanne E. Hambrusch:
Two-Layer Channel Routing with Vertical Uni-Length Overlap. Algorithmica 1(2): 223-232 (1986) - [j6]Mikhail J. Atallah, Susanne E. Hambrusch:
An assignment algorithm with applications to integrated circuit layout. Discret. Appl. Math. 13(1): 9-22 (1986) - [j5]Mikhail J. Atallah, Susanne E. Hambrusch:
Solving Tree Problems on a Mesh-Connected Processor Array. Inf. Control. 69(1-3): 168-187 (1986) - [j4]Mikhail J. Atallah, Susanne E. Hambrusch:
Optimal Rotation Problems in Channel Routing. IEEE Trans. Computers 35(9): 843-847 (1986) - 1985
- [j3]Susanne E. Hambrusch, Janos Simon:
Solving Undirected Graph Problems on VLSI. SIAM J. Comput. 14(3): 527-544 (1985) - [j2]Susanne E. Hambrusch:
Channel Routing Algorithms for Overlap Models. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 4(1): 23-30 (1985) - [c3]Mikhail J. Atallah, Susanne E. Hambrusch:
Solving Tree Problems on a Mesh-Connected Processor Array (Preliminary Version). FOCS 1985: 222-231 - 1983
- [j1]Susanne E. Hambrusch:
VLSI Algorithms for the Connected Component Problem. SIAM J. Comput. 12(2): 354-365 (1983) - [c2]Susanne E. Hambrusch, Janos Simon:
Lower Bounds for Solving Undirected Graph Problems on VLSI. ICALP 1983: 292-303 - 1981
- [c1]Susanne E. Hambrusch:
VLSI Algorithms for the Connected Component Problem and its Verification Problem. WG 1981: 231-242
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-03 21:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
