Susanne Hambrusch
#168,533
Most Influential Person Now
Austrian-American computer scientist
Susanne Hambrusch's AcademicInfluence.com Rankings
Susanne Hambruschcomputer-science Degrees
Computer Science
#10690
World Rank
#11241
Historical Rank
Software Engineering
#355
World Rank
#361
Historical Rank
Database
#9085
World Rank
#9553
Historical Rank
Download Badge
Computer Science
Why Is Susanne Hambrusch Influential?
(Suggest an Edit or Addition)According to Wikipedia, Susanne Edda Hambrusch is an Austrian-American computer scientist whose research topics include data indexing for range queries, and computational thinking in computer science education. She is a professor of computer science at Purdue University.
Susanne Hambrusch's Published Works
Published Works
- Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects (2002) (379)
- Computational Thinking in Elementary and Secondary Teacher Education (2014) (365)
- On peer-to-peer media streaming (2002) (295)
- Introducing computational thinking in education courses (2011) (199)
- A multidisciplinary approach towards computational thinking for science majors (2009) (167)
- Expanding computer science education in schools: understanding teacher experiences and challenges (2016) (159)
- Indexing Uncertain Categorical Data (2007) (139)
- Orion 2.0: native support for uncertain data (2008) (120)
- Main Memory Evaluation of Monitoring Queries Over Moving Objects (2004) (114)
- Database Support for Probabilistic Attributes and Tuples (2008) (110)
- Efficient Evaluation of Continuous Range Queries on Moving Objects (2002) (100)
- Solving tree problems on a mesh-connected processor array (1985) (79)
- Parallelizing the Data Cube (2001) (79)
- Query Processing in Broadcasted Spatial Index Trees (2001) (78)
- Using peer-led team learning to increase participation and success of under-represented groups in introductory computer science (2009) (77)
- PLACE: A Query Processor for Handling Real-time Spatio-temporal Data Streams (2004) (64)
- Parallel Algorithms for Line Detection on a Mesh (1989) (64)
- Who Needs What: Recommendations for Designing Effective Online Professional Development for Computer Science Teachers (2018) (58)
- Channel Routing Algorithms for Overlap Models (1985) (53)
- Towards scalable location-aware services: requirements and research issues (2003) (50)
- Scalable spatio-temporal continuous query processing for location-aware services (2004) (49)
- New clique and independent set algorithms for circle graphs (1992) (41)
- VLSI Algorithms for the Connected Component Problem (1983) (41)
- The present and future of computational thinking (2009) (39)
- C/sup 3/: an architecture-independent model for coarse-grained parallel machines (1994) (37)
- Computational thinking in high school courses (2010) (36)
- C3: A Parallel Model for Coarse-Grained Machines (1996) (29)
- Planar linear arrangements of outerplanar graphs (1988) (28)
- Models for Parallel Computation (1996) (27)
- Communication Operations on Coarse-Grained Mesh Architectures (1995) (26)
- Embedding Complete Binary Trees into Butterfly Networks (1991) (26)
- Generation CS (2017) (24)
- Equitable Learning Environments in K-12 Computing (2019) (23)
- Parallel Algorithms for Gray-Scale Digitized Picture Component Labeling on a Mesh-Connected Computer (1994) (21)
- Teachers’ Perceptions of Student Misconceptions in Introductory Programming (2020) (20)
- Edge Weight Reduction Problems in Directed Acyclic Graphs (1997) (19)
- Embedding large tree machines into small ones (1988) (18)
- Finding Maximum Cliques on Circular-Arc Graphs (1987) (18)
- Multiple Network Embeddings into Hypercubes (1989) (16)
- Broadcasting and querying multi-dimensional index trees in a multi-channel environment (2006) (15)
- A Study of Connected Component Labeling Algorithms on the MPP (1988) (14)
- Challenges of a Computer Science Classroom: Initial Perspectives from Teachers (2015) (13)
- Parallel scalable libraries and algorithms for computer vision (1994) (12)
- OLAP for Trajectories (2008) (12)
- Maintaining spatial data sets in distributed-memory machines (1997) (12)
- Optimal Rotation Problems in Channel Routing (1986) (12)
- Optimal Three-Dimensional Layouts of Complete Binary Trees (1987) (11)
- The Orion Uncertain Data Management System (2008) (11)
- Termination detection in data-driven parallel computations/applications (2003) (11)
- Solving Undirected Graph Problems on VLSI (1985) (11)
- Efficient query execution on broadcasted index tree structures (2007) (11)
- Parallel algorithms for determining k-width- connectivity in binary images (1990) (10)
- Load balanced tree embeddings (1992) (10)
- The Importance of Computing Education Research (2016) (10)
- Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees (2000) (10)
- On the relationship between parallel computation and graph embeddings (1989) (10)
- Gender demographics trends and changes in U.S. CS departments (2011) (9)
- Broadcasting and blocking large data sets with an index tree (2002) (9)
- A Lower Bound on Embedding Large Hypercubes into Small Hypercubes (1990) (9)
- Efficient Evaluation of Continous Range Queries on Movng Objects (2002) (8)
- Query Selectivity Estimation for Uncertain Data (2008) (8)
- Generation CS (2017) (8)
- The complexity of graph problems on vlsi (1982) (8)
- Multiple Network Embedding into Hybercubes (1990) (8)
- Parallel algorithms for gray-scale image component labeling on a mesh-connected computer (1992) (7)
- Scalable S-to-P broadcasting on message-passing MPPs (1996) (6)
- Contour ranking on coarse grained machines: a case study for low-level vision computations (1997) (6)
- Minimizing broadcast costs under edge reductions in tree networks (1997) (6)
- New Clique and Independent Set Algorithms for Circle Graphs (Discrete Applied Mathematics 36 (1992) 1-24) (1993) (4)
- The role of models, software tools, and applications in high performance computing (1994) (4)
- The Indiana Center for Database Systems at Purdue University (2005) (4)
- Understanding the U.S. domestic computer science Ph.D. pipeline (2015) (4)
- On Terminal Assignments That Minimize the Density (1984) (4)
- Exploring the Baccalaureate Origin of Domestic Ph.D. Students in Computing Fields (2013) (3)
- A Lower Bound on Embedding Tree Machines with Balanced Processor Utilization (1988) (3)
- On Bipartite Matchings of Minimum Density (1987) (3)
- Parallel Algorithms for Bridge- and Bi-Connectivity on Minimum Area Meshes (1985) (3)
- Teaching Computational Thinking to Science Majors (2008) (3)
- Data replication for external searching in static tree structures (2000) (3)
- Minimizing the Diameter in Tree Networks Under Edge Reductions (1999) (3)
- Generation CS (2017) (3)
- Minimizing total wire length during 1-dimensional compaction (1992) (3)
- Broadcasting Indexed Multidimensional Data (2001) (3)
- A Coarse-Grained, Architecture-Independent Approach for Connected Component Labeling (1993) (2)
- Edge Weight Reduction Problems in Directed (1994) (2)
- Broadcasting Indexed Multidimensional Data*t (2001) (2)
- Determining maximum k-width-connectivity on meshes (1992) (2)
- Parallel Asynchronous Connected Components in a Mesh (1991) (2)
- An assignment algorithm with applications to integrated circuit layout (1986) (2)
- Information Management in a Ubiquitous Global Postioning Environment (2000) (2)
- Two-layer channel routing with vertical unit-length overlap (1986) (2)
- Minimizing Contact Points and Using Overlap on Two Layers (1983) (1)
- Shortest Path Computations in S-Graphs (1991) (1)
- Forging a Path: Faculty Interviews on the Present and Future of Computer Science Education in the United States (2022) (1)
- Parallel Heuristics for Determining Steiner Trees in Images (1990) (1)
- Preface to the special issue on parallel models (1998) (1)
- Parallel heuristics for the Steiner tree problem in images without sorting or routing (1990) (1)
- Parallelizing the Data Cube ; LECTURE NOTES IN COMPUTER SCIENCE (2013) (1)
- Computing: report leaps geographical barriers but stumbles over gender (2006) (1)
- Lower Bounds for Solving Undirected Graph Problems on VLSI (1983) (1)
- Data replication in static tree structures (2003) (1)
- Graduate Programs in CS Education: Why 2020 is the Right Time (2020) (1)
- Proceedings of the 1997 International Conference on Parallel Processing, August 11-15, 1997 (1997) (0)
- VLSI Algorithms for the Connected Component Problem and its Verification Problem (1981) (0)
- Session details: Panel (2010) (0)
- A framework for 1-D compaction with forbidden region avoidance (VLSI layout) (1991) (0)
- A Lower Bound on Embedding Large Hypercubesinto Small (1990) (0)
- New Algorithms and Approaches for 1-Dimensional Layout Compaction (1991) (0)
- S-to-P Broadcasting on Coarse-Grained Machines (1995) (0)
- New Cost Measures in Graph Embeddings (1989) (0)
- Topological Numbering of Features on a Mesh (CC-88-18) (1988) (0)
- On the Computational Complexity of Continuous Routing (1989) (0)
- The PhD Pipeline (2015) (0)
- Optimal Channel Placement for Multi-Terminal Nets (1989) (0)
- New algorithms for minimizing the longest wire length during circuit compaction (1993) (0)
- Report of the 21st midwest theory consortium (1990) (0)
- OLAP for Trajectories ; LECTURE NOTES IN COMPUTER SCIENCE (2013) (0)
- Shortest Path Computations in Source-Deplanarized Graphs (1993) (0)
- On Bounding the Number of Contact Points in Channel Routing (1983) (0)
- Query Selectivity Estimation for Uncertain Database (2013) (0)
- Topological numbering of features on a mesh (1991) (0)
- Editors' Foreword (1993) (0)
- Session details: Paper Session: BPC Initiatives (2020) (0)
- Optimal Placement for Multi-Terminal Nets (1984) (0)
- 1-D Compaction (1990) (0)
- I-D Compaction in the Presence of Forbidden Regions (2013) (0)
- Probabilistic Attributes and Tuples (2008) (0)
This paper list is powered by the following services:
Other Resources About Susanne Hambrusch
What Schools Are Affiliated With Susanne Hambrusch?
Susanne Hambrusch is affiliated with the following schools: