Susanne E. Hambrusch

Ran Libeskind-Hadas

Computer, 2015

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

[BibT_eX]

[DOI]

Ran Libeskind-Hadas

Eric Aaron

Commun. ACM, 2015

Challenges of a Computer Science Classroom: Initial Perspectives from Teachers.

[BibT_eX]

[DOI]

Aman Yadav

Sarah Gretter

Proceedings of the Workshop in Primary and Secondary Computing Education, 2015

2014

Computational Thinking in Elementary and Secondary Teacher Education.

[BibT_eX]

[DOI]

ACM Trans. Comput. Educ., 2014

2011

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

[BibT_eX]

[DOI]

Douglas Baumann

Jennifer Neville

Commun. ACM, 2011

Introducing computational thinking in education courses.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM technical symposium on Computer science education, 2011

2010

Computational thinking in high school courses.

[BibT_eX]

[DOI]

Proceedings of the 41st ACM technical symposium on Computer science education, 2010

2009

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

[BibT_eX]

[DOI]

Proceedings of the 40th SIGCSE Technical Symposium on Computer Science Education, 2009

A multidisciplinary approach towards computational thinking for science majors.

[BibT_eX]

[DOI]

Proceedings of the 40th SIGCSE Technical Symposium on Computer Science Education, 2009

The present and future of computational thinking.

[BibT_eX]

[DOI]

Proceedings of the 40th SIGCSE Technical Symposium on Computer Science Education, 2009

2008

Query Selectivity Estimation for Uncertain Data.

[BibT_eX]

[DOI]

Proceedings of the Scientific and Statistical Database Management, 2008

Orion 2.0: native support for uncertain data.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

Database Support for Probabilistic Attributes and Tuples.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Data Engineering, 2008

OLAP for Trajectories.

[BibT_eX]

[DOI]

Proceedings of the Database and Expert Systems Applications, 19th International Conference, 2008

The Orion Uncertain Data Management System.

[BibT_eX]

[DOI]

Proceedings of the 14th International Conference on Management of Data, 2008

2007

Efficient query execution on broadcasted index tree structures.

[BibT_eX]

[DOI]

Data Knowl. Eng., 2007

Indexing Uncertain Categorical Data.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Data Engineering, 2007

2006

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

[BibT_eX]

[DOI]

Inf. Syst., 2006

2005

The Indiana Center for Database Systems at Purdue University.

[BibT_eX]

[DOI]

Christopher W. Clifton

SIGMOD Rec., 2005

2004

Main Memory Evaluation of Monitoring Queries Over Moving Objects.

[BibT_eX]

[DOI]

Dmitri V. Kalashnikov

Distributed Parallel Databases, 2004

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

[BibT_eX]

[DOI]

Proceedings of the (e)Proceedings of the Thirtieth International Conference on Very Large Data Bases, VLDB 2004, Toronto, Canada, August 31, 2004

Scalable Spatio-temporal Continuous Query Processing for Location-aware Services.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM 2004), 2004

2003

Termination detection in data-driven parallel computations/applications.

[BibT_eX]

[DOI]

Erturk Dogan Kocalar

J. Parallel Distributed Comput., 2003

Data replication in static tree structures.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Towards scalable location-aware services: requirements and research issues.

[BibT_eX]

[DOI]

Proceedings of the ACM-GIS 2003, 2003

2002

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

[BibT_eX]

[DOI]

Yuni Xia

Dmitri V. Kalashnikov

Walid G. Aref

IEEE Trans. Computers, 2002

Parallelizing the Data Cube.

[BibT_eX]

[DOI]

Distributed Parallel Databases, 2002

On Peer-to-Peer Media Streaming.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS'02), 2002

Efficient Evaluation of Continuous Range Queries on Moving Objects.

[BibT_eX]

[DOI]

Dmitri V. Kalashnikov

Walid G. Aref

Proceedings of the Database and Expert Systems Applications, 13th International Conference, 2002

2001

Query Processing in Broadcasted Spatial Index Trees.

[BibT_eX]

[DOI]

Proceedings of the Advances in Spatial and Temporal Databases, 7th International Symposium, 2001

2000

Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees.

[BibT_eX]

[DOI]

Hyeong-Seok Lim

J. Graph Algorithms Appl., 2000

Data Replication for External Searching in Static Tree Structures.

[BibT_eX]

[DOI]

Proceedings of the 2000 ACM CIKM International Conference on Information and Knowledge Management, 2000

1999

Minimizing the Diameter in Tree Networks Under Edge Reductions.

[BibT_eX]

[DOI]

Hyeong-Seok Lim

Parallel Process. Lett., 1999

Editors' Foreword.

[BibT_eX]

[DOI]

Bruce M. Maggs

Theory Comput. Syst., 1999

Minimizing Broadcast Costs Under Edge Reductions in Tree Networks.

[BibT_eX]

[DOI]

Hyeong-Seok Lim

Discret. Appl. Math., 1999

1998

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

[BibT_eX]

[DOI]

Yi Liu

IEEE Trans. Parallel Distributed Syst., 1998

1997

Edge Weight Reduction Problems in Directed Acyclic Graphs.

[BibT_eX]

[DOI]

J. Algorithms, 1997

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

[BibT_eX]

[DOI]

Concurr. Pract. Exp., 1997

New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction.

[BibT_eX]

[DOI]

Algorithmica, 1997

Maintaining Spatial Data Sets in Distributed-Memory Machines.

[BibT_eX]

[DOI]

Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

1996

C<sup>3</sup>: A Parallel Model for Coarse-Grained Machines.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1996

Models for Parallel Computation.

[BibT_eX]

[DOI]

Proceedings of the 1996 International Conference on Parallel Processing Workshop, 1996

1995

Communication Operations on Coarse-Grained Mesh Architectures.

[BibT_eX]

[DOI]

Farooq Hameed

Parallel Comput., 1995

1994

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

[BibT_eX]

[DOI]

Xin He

Russ Miller

J. Parallel Distributed Comput., 1994

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

[BibT_eX]

[DOI]

Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Parallel scalable libraries and algorithms for computer vision.

[BibT_eX]

[DOI]

Proceedings of the 12th IAPR International Conference on Pattern Recognition, 1994

1993

Multiple Network Embedding into Hypercubes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1993

Shortest Path Computations in Source-Deplanarized Graphs.

[BibT_eX]

[DOI]

Greg N. Frederickson

Inf. Process. Lett., 1993

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

[BibT_eX]

[DOI]

Alberto Apostolico

Discret. Appl. Math., 1993

Determining Maximum K-width-connectivity on Meshes.

[BibT_eX]

[DOI]

Frank K. H. A. Dehne

Comput. Geom., 1993

1992

Load balanced tree embeddings.

[BibT_eX]

[DOI]

Parallel Comput., 1992

Minimizing total wire length during 1-dimensional compaction.

[BibT_eX]

[DOI]

Integr., 1992

New clique and independent set algorithms for circle graphs.

[BibT_eX]

[DOI]

Alberto Apostolico

Discret. Appl. Math., 1992

Parallel Algorithms for Gray-Scale Image Component Labeling on a Mesh-Connected Computer.

[BibT_eX]

[DOI]

Xin He

Russ Miller

Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

Determining Maximum itk-Width Connectivity on Meshes.

[BibT_eX]

[DOI]

Frank K. H. A. Dehne

Proceedings of the 6th International Parallel Processing Symposium, 1992

1991

Embedding Complete Binary Trees into Butterfly Networks.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1991

Parallel Algorithms for Determining k-Width Connectivity in Binary Images.

[BibT_eX]

[DOI]

Frank K. H. A. Dehne

J. Parallel Distributed Comput., 1991

Parallel Asynchronous Connected Components in a Mesh.

[BibT_eX]

[DOI]

Michael Luby

Inf. Process. Lett., 1991

A Framework for 1-D Compaction with Forbidden Region Avoidance.

[BibT_eX]

[DOI]

Comput. Geom., 1991

Topological Numbering of Features on a Mesh.

[BibT_eX]

[DOI]

Lynn E. Te Winkel

Algorithmica, 1991

A framework for 1-D compaction with forbidden region avoidance [VLSI layout].

[BibT_eX]

[DOI]

Proceedings of the First Great Lakes Symposium on VLSI, 1991

New Algorithms and Approaches for 1-Dimensional Layout Compaction.

[BibT_eX]

[DOI]

Proceedings of the New Results and New Trends in Computer Science, 1991

1990

Report of the 21st midwest theory consortium.

[BibT_eX]

[DOI]

SIGACT News, 1990

Parallel heuristics for the Steiner tree problem in images without sorting or routing.

[BibT_eX]

[DOI]

Lynn TeWinkel

Proceedings of the 10th IAPR International Conference on Pattern Recognition, 1990

1989

Parallel Algorithms for Line Detection on a Mesh.

[BibT_eX]

[DOI]

Concettina Guerra

J. Parallel Distributed Comput., 1989

On the Computational Complexity of Continuous Routing.

[BibT_eX]

[DOI]

Yukon Chang

Janos Simon

J. Algorithms, 1989

Optimal Channel Placement for Multi-Terminal Nets.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 1989

1987

On Bipartite Matchings of Minimum Density.

[BibT_eX]

[DOI]

J. Algorithms, 1987

Optimal Three-Dimensional Layouts of Complete Binary Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1987

Finding Maximum Cliques on Circular-Arc Graphs.

[BibT_eX]

[DOI]

Alberto Apostolico

Inf. Process. Lett., 1987

1986

Optimal Rotation Problems in Channel Routing.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1986

Solving Tree Problems on a Mesh-Connected Processor Array

[BibT_eX]

[DOI]

Inf. Control., 1986

An assignment algorithm with applications to integrated circuit layout.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1986

Two-Layer Channel Routing with Vertical Uni-Length Overlap.

[BibT_eX]

[DOI]

Shaodi Gao

Algorithmica, 1986

1985

Channel Routing Algorithms for Overlap Models.

[BibT_eX]

[DOI]

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1985

Solving Undirected Graph Problems on VLSI.

[BibT_eX]

[DOI]

Janos Simon

SIAM J. Comput., 1985

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

[BibT_eX]

[DOI]

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1983

VLSI Algorithms for the Connected Component Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 1983

Lower Bounds for Solving Undirected Graph Problems on VLSI.

[BibT_eX]

[DOI]

Janos Simon

Proceedings of the Automata, 1983

1981

VLSI Algorithms for the Connected Component Problem and its Verification Problem.

[BibT_eX]