Mark Allen Weiss

	2008
25		Mark Allen Weiss: Parameter Passing. Wiley Encyclopedia of Computer Science and Engineering 2008
	2004
24		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
23		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
22		David Gries, Kathleen Larson, Susan H. Rodger, Mark Allen Weiss, Ursula Wolz: AP CS goes OO. SIGCSE 2001: 423-24
	2000
21		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
	1998
20		Mark Stehlik, Sarah Fix, Susan H. Rodger, Chris Nevison, Mark Allen Weiss: Advanced placement transition to C++ (panel). SIGCSE 1998: 372
19		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)
	1997
18		Mark Allen Weiss: Experiences teaching data structures with Java. SIGCSE 1997: 164-168
	1996
17		Sha Guo, Wei Sun, Mark Allen Weiss: Solving Satisfiability and Implication Problems in Database Systems. ACM Trans. Database Syst. 21(2): 270-293 (1996)
16		Mark Allen Weiss: Shellsort with a Constant Number of Increments. Algorithmica 16(6): 649-654 (1996)
15		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)
	1995
14		Mark Allen Weiss: A Note on Construction of Treaps and Cartesian Trees. Inf. Process. Lett. 54(2): 127 (1995)
	1994
13		Wei Sun, Mark Allen Weiss: An Improved Algorithm for Implication Testing Involving Arithmetic Inequalities. IEEE Trans. Knowl. Data Eng. 6(6): 997-1001 (1994)
12		Yuzheng Ding, Mark Allen Weiss: On the Complexity of Building an Interval Heap. Inf. Process. Lett. 50(3): 143-144 (1994)
11		Mark Allen Weiss: Linear-Time Construction of Treaps and Cartesian Trees. Inf. Process. Lett. 52(5): 253-257 (1994)
	1993
10		Cyril U. Orji, Mark Allen Weiss, Jon A. Solworth: Improved Tradtional Mirror. FODO 1993: 329-344
9		Yuzheng Ding, Mark Allen Weiss: The K-D Heap: An Efficient Multi-dimensional Priority Queue. WADS 1993: 302-313
8		Yuzheng Ding, Mark Allen Weiss: The Relaxed min-max Heap. Acta Inf. 30(3): 215-231 (1993)
7		Mark Allen Weiss: On Finding the Height of a Binary Search Tree. Comput. J. 36(3): 280-281 (1993)
	1991
6		Mark Allen Weiss: Empirical Study of the Expected Running Time of Shellsort. Comput. J. 34(1): 88-91 (1991)
	1990
5		Mark Allen Weiss, Robert Sedgewick: More on Shellsort Increment Sequences. Inf. Process. Lett. 34(5): 267-270 (1990)
4		Mark Allen Weiss, Robert Sedgewick: Tight Lower Bounds for Shellsort. J. Algorithms 11(2): 242-251 (1990)
	1989
3		Mark Allen Weiss, Jainendra K. Navlakha: The Distribution of Keys in a Binary Heap. WADS 1989: 510-516
	1988
2		Mark Allen Weiss, Robert Sedgewick: Tight Lower Bounds for Shellsort. SWAT 1988: 255-262
1		Mark Allen Weiss, Robert Sedgewick: Bad Cases for Shaker-Sort. Inf. Process. Lett. 28(3): 133-136 (1988)

Coauthor Index

1	Shu-Ching Chen	[21] [24]
2	Yuzheng Ding	[8] [9] [12]
3	Robert L. Scot Drysdale (Robert L. (Scot) Drysdale III)	[23]
4	Sarah Fix	[20]
5	David Gries	[22]
6	Sha Guo	[15] [17] [19]
7	Reg Hahne	[23]
8	Judith Hromcik	[23]
9	Kathleen Larson	[22]
10	Jainendra K. Navlakha	[3]
11	Christopher H. Nevison (Chris Nevison)	[20]
12	Cyril U. Orji	[10]
13	Naphtali Rishe	[21] [24]
14	Susan H. Rodger	[20] [22]
15	Robert Sedgewick	[1] [2] [4] [5]
16	Jon A. Solworth	[10]
17	Mark Stehlik	[20]
18	Wei Sun	[13] [15] [17] [19]
19	Xinran Wang	[21] [24]
20	Ursula Wolz	[22]

Colors in the list of coauthors