Mark Allen Weiss

Judithe Sheard

ACM SIGCSE Bull., 2019

SIGCSE top ten symposium papers of all time award.

[BibT_eX]

[DOI]

Adrienne Decker

ACM SIGCSE Bull., 2019

2018

A Structural Equation Model Analysis of Computing Identity Sub-Constructs and Student Academic Persistence.

[BibT_eX]

[DOI]

Michael Georgiopoulos

Proceedings of the IEEE Frontiers in Education Conference, 2018

2017

CircGR: Interactive Multi-Touch Gesture Recognition using Circular Measurements.

[BibT_eX]

[DOI]

Ruben Balcazar

Francisco Raul Ortega

Proceedings of the Interactive Surfaces and Spaces, 2017

2015

Data Structures Courses: Past, Present, and Future.

[BibT_eX]

[DOI]

Proceedings of the 46th ACM Technical Symposium on Computer Science Education, 2015

2014

Data Structures.

[BibT_eX]

Proceedings of the Computing Handbook, 2014

2008

Parameter Passing.

[BibT_eX]

[DOI]

Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

2006

Data structures and algorithms analysis in C++, Third Edition.

[BibT_eX]

Pearson international edition, Addison-Wesley, ISBN: 978-0-321-39733-1, 2006

2004

Data Structures in C++.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Data Structures and Applications., 2004

A web-based spatial data access system using semantic <i>R</i>-trees.

[BibT_eX]

[DOI]

Inf. Sci., 2004

2003

Java in the morning...Java in the evening...Java in 2004.

[BibT_eX]

[DOI]

Robert L. Scot Drysdale

Judith Hromcik

Reg Hahne

Proceedings of the 34th SIGCSE Technical Symposium on Computer Science Education, 2003

2001

AP CS goes OO.

[BibT_eX]

[DOI]

Proceedings of the 32rd SIGCSE Technical Symposium on Computer Science Education, 2001

2000

A high-performance Web-based system design for spatial data accesses.

[BibT_eX]

[DOI]

Proceedings of the ACM-GIS 2000, 2000

1998

Addendum to "On Satisfiability, Equivalence, and Implication Problems Involving Conjunctive Queries in Database Systems".

[BibT_eX]

Sha Guo

IEEE Trans. Knowl. Data Eng., 1998

Data structures and problem solving using Java.

[BibT_eX]

[DOI]

SIGACT News, 1998

Advanced placement transition to C++ (panel).

[BibT_eX]

[DOI]

Proceedings of the 29th SIGCSE Technical Symposium on Computer Science Education, 1998

1997

The reasoning for the advanced placement C++ subset.

[BibT_eX]

[DOI]

ACM SIGCSE Bull., 1997

Experiences teaching data structures with Java.

[BibT_eX]

[DOI]

Proceedings of the 28th SIGCSE Technical Symposium on Computer Science Education, 1997

1996

Solving Satisfiability and Implication Problems in Database Systems.

[BibT_eX]

[DOI]

Sha Guo

ACM Trans. Database Syst., 1996

On Satisfiability, Equivalence, and Impication Problems Involving Conjunctive Queries in Database Systems.

[BibT_eX]

[DOI]

Sha Guo

IEEE Trans. Knowl. Data Eng., 1996

Shellsort with a Constant Number of Increments.

[BibT_eX]

[DOI]

Algorithmica, 1996

1995

Algorithms, Problem Solving, and Data Structures with C++.

[BibT_eX]

[DOI]

SIGACT News, 1995

Journal Backlog Report.

[BibT_eX]

[DOI]

SIGACT News, 1995

Technical Report Column.

[BibT_eX]

[DOI]

SIGACT News, 1995

A Note on Construction of Treaps and Cartesian Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

1994

An Improved Algorithm for Implication Testing Involving Arithmetic Inequalities.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 1994

Linear-Time Construction of Treaps and Cartesian Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

On the Complexity of Building an Interval Heap.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

Data structures and algorithm analysis, Second Edition.

[BibT_eX]

Benjamin/Cummings, ISBN: 978-0-8053-9057-5, 1994

1993

On Finding the Height of a Binary Search Tree.

[BibT_eX]

[DOI]

Comput. J., 1993

The Relaxed min-max Heap.

[BibT_eX]

[DOI]

Acta Informatica, 1993

The K-D Heap: An Efficient Multi-dimensional Priority Queue.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Improved Tradtional Mirror.

[BibT_eX]

[DOI]

Cyril U. Orji

Jon A. Solworth

Proceedings of the Foundations of Data Organization and Algorithms, 1993

Data structures and algorithm analysis in Ada.

[BibT_eX]

Benjamin/Cummings, ISBN: 978-0-8053-9055-1, 1993

Data structures and algorithm analysis in C.

[BibT_eX]

Benjamin/Cummings, ISBN: 978-0-8053-5440-9, 1993

1992

Best case lower bounds for Heapsort.

[BibT_eX]

[DOI]

Computing, 1992

Data structures and algorithm analysis.

[BibT_eX]

Addison-Wesley, ISBN: 978-0-8053-9052-0, 1992

1991

Empirical Study of the Expected Running Time of Shellsort.

[BibT_eX]

[DOI]

Comput. J., 1991

1990

Tight Lower Bounds for Shellsort.

[BibT_eX]

[DOI]