Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Mark Allen Weiss
2000 – 2009
- 2008
[p1]- 2004
- [j24]Shu-Ching Chen, Xinran Wang, Naphtali Rishe, Mark Allen Weiss: A web-based spatial data access system using semantic R-trees. Inf. Sci. 167(1-4): 41-61 (2004)
- 2003
- [c9]Robert L. Scot Drysdale, Judith Hromcik, Mark Allen Weiss, Reg Hahne: Java in the morning...Java in the evening...Java in 2004. SIGCSE 2003: 271-272
- 2001
- [c8]David Gries, Kathleen Larson, Susan H. Rodger, Mark Allen Weiss, Ursula Wolz: AP CS goes OO. SIGCSE 2001: 423-24
- 2000
- [c7]Shu-Ching Chen, Xinran Wang, Naphtali Rishe, Mark Allen Weiss: A high-performance Web-based system design for spatial data accesses. ACM-GIS 2000: 33-38
1990 – 1999
- 1998
- [j23]
- [j22]Sha Guo, Wei Sun, Mark Allen Weiss: Addendum to "On Satisfiability, Equivalence, and Implication Problems Involving Conjunctive Queries in Database Systems". IEEE Trans. Knowl. Data Eng. 10(5): 863 (1998)
- [c6]Mark Stehlik, Sarah Fix, Susan H. Rodger, Chris Nevison, Mark Allen Weiss: Advanced placement transition to C++ (panel). SIGCSE 1998: 372
- 1997
- [j21]Owen L. Astrachan, Gail Chapman, Susan H. Rodger, Mark Allen Weiss: The reasoning for the advanced placement C++ subset. SIGCSE Bulletin 29(4): 62-65 (1997)
- [c5]
- 1996
- [j20]Mark Allen Weiss: Shellsort with a Constant Number of Increments. Algorithmica 16(6): 649-654 (1996)
- [j19]
- [j18]
- [j17]Sha Guo, Wei Sun, Mark Allen Weiss: On Satisfiability, Equivalence, and Impication Problems Involving Conjunctive Queries in Database Systems. IEEE Trans. Knowl. Data Eng. 8(4): 604-616 (1996)
- [j16]Sha Guo, Wei Sun, Mark Allen Weiss: Solving Satisfiability and Implication Problems in Database Systems. ACM Trans. Database Syst. 21(2): 270-293 (1996)
- 1995
- [j15]Mark Allen Weiss: A Note on Construction of Treaps and Cartesian Trees. Inf. Process. Lett. 54(2): 127 (1995)
- [j14]
- [j13]
- [j12]
- [j11]
- [j10]Mark Allen Weiss: Algorithms, Problem Solving, and Data Structures with C++. SIGACT News 26(4): 39-50 (1995)
- 1994
- [b4]Mark Allen Weiss: Data structures and algorithm analysis (2. ed.). Benjamin/Cummings 1994, ISBN 978-0-8053-9057-5, pp. I-XVII, 1-507
- [j9]Yuzheng Ding, Mark Allen Weiss: On the Complexity of Building an Interval Heap. Inf. Process. Lett. 50(3): 143-144 (1994)
- [j8]Mark Allen Weiss: Linear-Time Construction of Treaps and Cartesian Trees. Inf. Process. Lett. 52(5): 253-257 (1994)
- [j7]Wei Sun, Mark Allen Weiss: An Improved Algorithm for Implication Testing Involving Arithmetic Inequalities. IEEE Trans. Knowl. Data Eng. 6(6): 997-1001 (1994)
- 1993
- [b3]Mark Allen Weiss: Data structures and algorithm analysis in Ada. Benjamin/Cummings 1993, ISBN 978-0-8053-9055-1, pp. I-XV, 1-480
- [b2]Mark Allen Weiss: Data structures and algorithm analysis in C. Benjamin/Cummings 1993, ISBN 978-0-8053-5440-9, pp. I-XVII, 1-461
- [j6]
- [j5]
- [c4]
- [c3]Yuzheng Ding, Mark Allen Weiss: The K-D Heap: An Efficient Multi-dimensional Priority Queue. WADS 1993: 302-313
- 1992
- [b1]Mark Allen Weiss: Data structures and algorithm analysis. Addison-Wesley 1992, ISBN 978-0-8053-9052-0, pp. I-XVII, 1-455
- 1991
- [j4]Mark Allen Weiss: Empirical Study of the Expected Running Time of Shellsort. Comput. J. 34(1): 88-91 (1991)
- 1990
- [j3]Mark Allen Weiss, Robert Sedgewick: More on Shellsort Increment Sequences. Inf. Process. Lett. 34(5): 267-270 (1990)
- [j2]Mark Allen Weiss, Robert Sedgewick: Tight Lower Bounds for Shellsort. J. Algorithms 11(2): 242-251 (1990)
1980 – 1989
- 1989
- [c2]Mark Allen Weiss, Jainendra K. Navlakha: The Distribution of Keys in a Binary Heap. WADS 1989: 510-516
- 1988
- [j1]Mark Allen Weiss, Robert Sedgewick: Bad Cases for Shaker-Sort. Inf. Process. Lett. 28(3): 133-136 (1988)
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-09-17 23:26 CEST by the dblp team