UNC School of Law Van Hecke-Wettach Hall 100 Ridge Road, CB #3380 Chapel Hill, NC 27599-3380 Phone:  (919) 962-4116 Fax:  (919) 962-1277

Journal Articles

1. Artful Prior Art and the Quality of DNA Patents, 57 ALAB. L. REV. 975 (2006).
2. Research in the Shadow of DNA Patents, 87 J. PAT. & TRADEMARK OFF. SOC'Y 846 (2005).
3. Decoding Microsoft: A First Principles Approach, 40 WAKE FOREST L. REV. 1 (2005).
4. Antitrust Analysis in Software Product Markets: A First Principles Approach, 18 HARV. J.L. & TECH. 1 (2004).
5. Computational Complexity and the Scope of Software Patents, 39 JURIMETRICS 17 (1999).
6. Spoiling the Surprise: Constraints Facing Random Regulatory Inspections in Japan and the United States, 20 NW. J. INT'L L. & BUS. 99 (1999).
7. Analyzing Mergers in Innovation Markets, 38 JURIMETRICS 119 (1998).
8. Making the World Wide Web Safe for Democracy: A Medium Specific First Amendment Analysis, 19 HASTINGS COMM. & ENT. L.J. 309 (1997).
9. Accurate Calculation of Short-Swing Profits Under Section 16(b) of the Securities Exchange Act of 1934, 22 DEL. J. CORP. L. 587 (1997).
10. Note, Antitrust By Chance: A Unified Theory of Horizontal Merger Doctrine, 106 YALE L.J. 1165 (1997).
11. The 1995 National Asian American Studies Examination in U.S. High Schools, 21 AMERASIA J. 121 (1995).
12. Locality-Preserving Hash Functions for General Purpose Parallel Computation, 12 ALGORITHMICA 170 (1994).
13. (with W.F. McColl) Virtual Shared Memory: Algorithms and Complexity, 113 INFO. & COMPUTATION 199 (1993).
14. Permutations on the Block PRAM, 45 INFO. PROCESSING LETTERS 60 (1993).
15. On the Depth Complexity of the Counting Functions, 35 INFO. PROCESSING LETTERS 325 (1990).

Book Chapters

1. The KKK and Vietnamese Fishermen, in DIVERSTORY (working title) (Frank Wu, ed., forthcoming 2002).
2. Latency Hiding for Fault Tolerant PRAM Computations, in SETS, GRAPHS AND NUMBERS (Gabor Halasz et al., ed., 1992).
3. Complexity Models for All-Purpose Parallel Computation, in LECTURES ON PARALLEL COMPUTATION 393 (Alan M. Gibbons & Paul Spirakis, eds., 1993).

Conference Presentations

1. "Locality-Preserving Hashing," Dartmouth Institute for Advanced Graduate Studies in Parallel Computing, June 1993. 
2. "Uniformity of Shared Memory," Seventh British Colloquium on Theoretical Computer Science, Liverpool, England, March 1991.
3. "On the Depth Complexity of the Counting Functions," London Mathematical Society Symposium on Boolean Function Complexity, Durham, England, Summer 1990 (Invited).
4. "Virtual Shared Memory: Algorithms and Complexity," Sixth British Colloquium on Theoretical Computer Science, Manchester, England, March 1990.
5. "On the Depth Complexity of the Counting Functions," Fifth British Colloquium on Theoretical Computer Science, London, England, March 1989.

Addresses

1. "Making the World Wide Web Safe for Democracy," Yale Law & Technology Society, Spring 1997.

Colloquium Presentations

1. "Virtual Shared Memory," International Computer Science Institute, University of California at Berkeley, Summer 1991.
2. "Parallel Algorithms and Locality," Department of Computer Science, University of Southampton, Spring 1990.
3. Department of Computer Science, University of Warwick.
4. Department of Computer Science, University of Texas at Austin.
5. Computing Laboratory, Oxford.
6. Mathematical Institute, Oxford.

Panel Discussions

Ford Foundation Project on "The Public Telecommunications Service," Institute for Philosophy and Public Policy, University of Maryland, June 2001 (Invited).

Professional Workshops

1. Dartmouth Institute for Advanced Graduate Studies in Parallel Computation, Dartmouth University, Summer 1992 and 1993.
2. Algorithms and Complexity, Second International Summer School for Computer Science Research, Acireale, Italy, Summer 1990.
3. Paths, Flows, and VLSI Layout, Research Institute of Discrete Mathematics, Rheinisch Friedrich-Wilhelms-Universitaet Bonn, June-July 1988.
4. Budapest Semesters in Mathematics, Technical University of Budapest, Spring 1987.