# Mark Allen Weiss

According to our database

Collaborative distances:

^{1}, Mark Allen Weiss authored at least 43 papers between 1988 and 2017.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2017

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

Proceedings of the Interactive Surfaces and Spaces, 2017

2015

Data Structures Courses: Past, Present, and Future.

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

2014

Data Structures.

Proceedings of the Computing Handbook, 2014

2008

Parameter Passing.

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

2004

Data Structures in C++.

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

A web-based spatial data access system using semantic

*R*-trees.
Inf. Sci., 2004

2003

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

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

2001

AP CS goes OO.

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

2000

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

Proceedings of the ACM-GIS 2000, 2000

1998

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

IEEE Trans. Knowl. Data Eng., 1998

Data structures and problem solving using Java.

SIGACT News, 1998

Advanced placement transition to C++ (panel).

Proceedings of the 29th SIGCSE Technical Symposium on Computer Science Education, 1998, Atlanta, Georgia, USA, February 26, 1998

1997

The reasoning for the advanced placement C++ subset.

SIGCSE Bulletin, 1997

Experiences teaching data structures with Java.

Proceedings of the 28th SIGCSE Technical Symposium on Computer Science Education, 1997, San Jose, California, USA, February 27, 1997

1996

Solving Satisfiability and Implication Problems in Database Systems.

ACM Trans. Database Syst., 1996

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

IEEE Trans. Knowl. Data Eng., 1996

Journal Backlog Report.

SIGACT News, 1996

Technical Report Column.

SIGACT News, 1996

Shellsort with a Constant Number of Increments.

Algorithmica, 1996

1995

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

SIGACT News, 1995

Journal Backlog Report.

SIGACT News, 1995

Technical Report Column.

SIGACT News, 1995

Journal Backlog Report.

SIGACT News, 1995

Technical Report Column.

SIGACT News, 1995

A Note on Construction of Treaps and Cartesian Trees.

Inf. Process. Lett., 1995

1994

An Improved Algorithm for Implication Testing Involving Arithmetic Inequalities.

IEEE Trans. Knowl. Data Eng., 1994

Linear-Time Construction of Treaps and Cartesian Trees.

Inf. Process. Lett., 1994

On the Complexity of Building an Interval Heap.

Inf. Process. Lett., 1994

Data structures and algorithm analysis (2. ed.).

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

1993

On Finding the Height of a Binary Search Tree.

Comput. J., 1993

The Relaxed min-max Heap.

Acta Inf., 1993

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

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

Improved Tradtional Mirror.

Proceedings of the Foundations of Data Organization and Algorithms, 1993

Data structures and algorithm analysis in Ada.

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

Data structures and algorithm analysis in C.

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

1992

Best case lower bounds for Heapsort.

Computing, 1992

Data structures and algorithm analysis.

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

1991

Empirical Study of the Expected Running Time of Shellsort.

Comput. J., 1991

1990

Tight Lower Bounds for Shellsort.

J. Algorithms, 1990

More on Shellsort Increment Sequences.

Inf. Process. Lett., 1990

1989

The Distribution of Keys in a Binary Heap.

Proceedings of the Algorithms and Data Structures, 1989

1988

Bad Cases for Shaker-Sort.

Inf. Process. Lett., 1988

Tight Lower Bounds for Shellsort.

Proceedings of the SWAT 88, 1988