Vita

Education:

• Ph.D. in Computer Science, August 1980, Carnegie-Mellon University. Dissertation title: A Complexity Theory for VLSI. Chairman: H.T. Kung.
• M.S. in Computer Science / Computer Engineering, B.S. (honors) in Chemistry, June 1975, Stanford University.

Professional Memberships and Recognition:

• Member of RSNZ, the Royal Society of New Zealand.
• Senior member of IEEE, the Institute of Electrical and Electronics Engineers.
• Member of ACM, the Association for Computing Machinery.
• Member of the New Zealand Security Association.
• Primary Representative for The University of Auckland to The Jericho Forum, since 2005.
• Member of Chair Professor Group in Software Theory, Tsinghua University, 2009-2011.

Work Experience:

• 4/96 to present: Professor of Computer Science, Auckland University, New Zealand. Teaching duties: Software Security (COMPSCI 725), Computer Architecture (COMPSCI 313), Operating Systems (COMPSCI 340), Algorithms (COMPSCI 320), and Performance Evaluation of Computer Systems (415.704).
• 8/95 to 2/96: Systems Integrator, under contract to Digital Biometrics Inc., Minnesota. Specified software and hardware/software interfaces, implemented video-capture and mag-card reader software for prototype PC-based systems.
• 9/95 to 4/96: Visiting Professor of Computer Science at the University of Minnesota, Twin Cities campus. Taught comparative programming languages.
• 8/94 to 2/95: Principal Programmer at LaserMaster Corporation, Minneapolis, Minnesota. Benchmarked and optimized wide-bed color PostScript printers.
• 9/86 to 7/94: Professor of Computer Science at the University of Minnesota, Duluth. Promoted from Associate Professor 9/89. Adjunct Professor of Computer Science at the University of Minnesota, Twin Cities; full member of the Ph.D.-granting programs in Computer Science and in Scientific Computation, with teaching duties in Computer Science and Computer Engineering departments of Duluth: Computer Architecture (CpE 3070, CS 5510, CS 5511, CS 8021), Algorithms (CS 5726), Data Structures and Algorithms (CS 3526, CS 5518), Multiprocessor Systems (CpE 3515), Theory of VLSI and Parallel Algorithms (CS 8010), Machine Language and Organization (CS 3610), and Advanced Peripheral Interfacing (CpE 3515).
• 9/92 to 6/93: Visiting Professor of Electrical Engineering and Computer Science, Massachusetts Institute of Technology. Recitation instructor in 6.004, Computation Structures. Lecturer in 6.891, Source Code Optimization for Workstations and Supercomputers. Conducted research in collaboration with Charles Leiserson and other members of the Boston-area research community.
• 5/91: Academic Visitor, IBM T.J. Watson Research Laboratory, Yorktown Heights, NY. Conducted research on source code optimization and rectilinear Steiner tree minimization. Supervisor: Larry Carter.
• 9/79 to 6/86: Assistant Professor at UC Berkeley. Developed new hardware and software for our undergraduate microprocessor interfacing lab (CS 154); taught courses on graph theory and combinatorics (CS 174) and VLSI complexity theory (CS 274). Helped to found the Computer Science Division's Re-Entry Program for women and under-represented minorities.
• 6/84 to 7/84: Scientific Worker II at the Institute of Technical Cybernetics, Slovak Academy of Sciences, Bratislava, Czechoslovakia. Conducted research on VLSI complexity theory with Ondrej Sýkora, Imrich Vrto, and Pavol Duris.
• 9/75 to 5/79: Research Assistant (NSF Fellow) at C-MU. Performed research in computational complexity, focusing on communication issues in parallel computers, under H.T. Kung.
• 5/78 to 8/78: Research Intern at Xerox PARC, Palo Alto, CA. Studied algorithms and complexity issues for VLSI, under Leo Guibas.
• 5/76 to 8/76: Research Assistant at IBM, San Jose, CA. Under Mario Schkolnick, designed and analyzed algorithms for disk storage optimization of large-scale data bases.
• 5/73 to 8/75: Assembly language programmer for Nicolet Technology Inc., Mountain View, CA. Developed software, including Fourier transform routines, for minicomputer-based FT-NMR spectrometers, under the supervision of Bill Siebert.

Consultancies (partial listing):

• 2002, 2003: Short-term research consultancy at the Cryptography and Anti-piracy Research Group at Microsoft R&D Labs, Redmond WA (USA).
• 1998-: Patent consultancy, as inventor and assignor, to InterTrust Inc of Sunnyvale CA (USA).
• 2000: Forensic examination of computer disks, for Paul Davison QC of Auckland (NZ).
• 1996-7: Expert witness in a patent dispute, for Robins Kaplan Miller & Cerisi of Minneapolis MN (USA).

Articles in Refereed Journals:

1. Multimedia Applications and Security in MapReduce: Opportunities and Challenges, by Zhiwei Yu, Chaokun Wang, Clark Thomborson, Jianmin Wang, Shiguo Lian, and Athanasios Vasilikos, to appear in Concurrency and Computation: Practice and Experience, Wiley, 2011.
2. Novel Watermarking Method for Software Protection in the Cloud, by Zhiwei Yu, Chaokun Wang, Clark Thomborson, Jianmin Wang, Shiguo Lian, and Athanasios Vasilikos, to appear in Software: Practice and Experience, Wiley, 2011.
3. Dynamic graph-based software fingerprinting, by Christian S. Collberg, Clark Thomborson, and Gregg M. Townsend, ACM TOPLAS 29(6) 35:1-67, October 2007.
4. Recent software protection techniques - Hardware-assisted tamper prevention (in Japanese), by Akito Monden and Clark Thomborson, IPSJ Magazine 46:5, Information Processing Society of Japan, pp. 558 - 563, May 2005.
5. Recent software protection techniques - Software-only tamper prevention (in Japanese), by Akito Monden and Clark Thomborson, IPSJ Magazine 46:4, Information Processing Society of Japan, pp. 431 - 437, April 2005.
6. Tamper-resistant software system based on a finite state machine, by Akito Monden, Antoine Monsifrot, and Clark Thomborson, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Special Section on Cryptography and Information Security, Vol.E88-A, No.1, pp. 112-122, 1 January 2005.
7. Watermarking, tamper-proofing, and obfuscation - Tools for software protection, by Christian Collberg and Clark Thomborson, IEEE Transactions on Software Engineering 28:8, 735-746, August 2002. DOI: 10.1109/TSE.2002.1027797.
8. The economics of large-memory computations, by Clark Thomborson, Information Processing Letters 66, 263-268, 1998.
9. Optimized carry lookahead adders with direct feeding, by Marek J. Patyra, Yi Sun, and Clark Thomborson, Microelectronics and Reliability 36: 2, 121-132, 2 February 1996.
10. A probably fast, provably optimal algorithm for rectilinear Steiner trees, by Linda L. Deneen, Gary M. Shute, and Clark Thomborson, Random Structures & Algorithms 5:4, pp. 535-557, 1994.
11. Does your workstation computation belong on a supercomputer?, by Clark D. Thomborson, C. ACM 36:11, pp. 41-49 and 94, November 1993.
12. The V.42bis standard for data-compressing modems, by Clark Thomborson, IEEE Micro 12:5, 41-53, October 1992.
13. Delay optimization of carry-skip adders and block carry-lookahead adders, by Pak K. Chan, Martine D.F. Schlag, Clark D. Thomborson, and Vojin G. Oklobdzija, IEEE Trans. Computers 41: 8, 920-930, August 1992. DOI: 10.1109/12.156534.
14. An O(n log n) plane-sweep algorithm for L₁ and L_¥ Delauney Triangulations, by Gary M. Shute, Linda L. Deneen and Clark D. Thomborson, Algorithmica 6, 207-221, 1991.
15. Multiterminal global routing: a deterministic approximation scheme, by Prabhakar Raghavan and Clark Thompson, Algorithmica 6, 73-82, 1991.
16. Area-time optimal adder design, by Belle W.Y. Wei and Clark D. Thompson, IEEE Trans. Computers 39:5, 666-675, May 1990. DOI: 10.1109/12.53579.
17. Randomized rounding: a technique for provably good algorithms and algorithmic proofs, by Prabhakar Raghavan and Clark Thompson, Combinatorica 7:4, 365-374, 1987.
18. Experimental results for a linear-program global router, by Antony P-C Ng, Prabhakar Raghavan, and Clark D. Thompson, Computers and Artificial Intelligence 6:3, 229-242, 1987.
19. Global wire routing in two-dimensional arrays, by R.M. Karp, F.T. Leighton, R. Rivest, C. Thompson, V.V. Vazirani, and U.V. Vazirani, Algorithmica, 113-130, February 1987.
20. A minimum-area circuit for l-selection, by Pavol Duris, Ondrej Sýkora, Clark Thompson, and Imrich Vrto, Algorithmica, January 1987.
21. Military direction of academic CS research, by Clark Thompson, Communications of the ACM 29:7, 583-585, July 1986.
22. Military control of over half of computer science research is excessive, by Clark Thompson, Computers and People 35:3-4, 25-27, March-April 1986.
23. Tight chip area bounds for sorting, by Pavol Duris, Ondrej Sýkora, Clark Thompson, and Imrich Vrto, Computers and Artificial Intelligence 4:6, 535-544, December 1985.
24. Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard Transformations, by Pavol Duris, Ondrej Sýkora, Clark Thompson, and Imrich Vrto, Information Processing Letters 21, 245-247, 18 November 1985.
25. VLSI design with multiple active layers, Information Processing Letters 21, 109-111, 5 September 1985.
26. The VLSI complexity of sorting (Japanese translation), Information Processing Society Journal 26:6, 640-651, June 1985.
27. An efficient implementation of search trees on \ceiling{log n + 1} processors, by Michael J. Carey and Clark D. Thompson, IEEE Trans. Computers C-33:11, 1038-1041, November 1984. DOI: 10.1109/TC.1984.1676379.
28. The VLSI complexity of sorting, IEEE Trans. Computers C-32:12, 1171-1184, December 1983. DOI: 10.1109/TC.1983.1676178.
29. Fourier transforms in VLSI, IEEE Trans. Computers C-32:11, 1047-1057, November 1983. DOI: 10.1109/TC.1983.1676155.
30. Generalized connection networks for parallel processor intercommunication, IEEE Trans. Computers C-27:12, 1119-1125, December 1978. DOI: 10.1109/TC.1978.1675014.
31. On the average number of maxima in a set of vectors and applications, by J. L. Bentley, H. T. Kung, M. Schkolnick, and C. D. Thompson, J. ACM 25:4, 536-543, October 1978. DOI: 10.1145/322092.322095.
32. Sorting on a mesh-connected parallel computer, by C. D. Thompson and H. T. Kung, C. ACM 20:4, 263-271, April 1977. DOI: 10.1145/359461.359481

Patents and Published Patent Applications:

1. Code obfuscation technique for software security. Japanese patent 4739465, published 13 May 2011, by Christian Collberg, Clark Thomborson and Douglas Low. Assigned to InterTrust.
2. Method of introducing digital signature into software, NZ Patent 533028, by Clark Thomborson and Jasvir Nagra, assigned to Auckland Uniservices Ltd, granted 12 January 2006. Also published as US Patent Application 2005/0262490A1, 23 pp., 22 claims, filed 19 May 2005, published 24 November 2005; Canada (CA2507361); and Australia (AU5202102).
3. Tamper-proofing watermarked computer programs, US Patent Application 2005/0050396A1, by Clark Thomborson, Yong He, Ram Somaraju, and Jasvir Nagra, assigned to Auckland UniServices Ltd, 14 pp., 13 claims, filed 20 May 2004, published 3 March 2005.
4. Transaction system and method, US Patent Application 2004/0093310, by Clark Thomborson, assigned to Auckland UniServices Ltd, 17 pp., 19 claims, filed 24 September 2003, published 13 May 2004. New Zealand patent application 521555. Abandoned in 2007 after discovering prior art in US 6856977, Method and system for proving ownership of digital data, by Adelsbach, Pfitzmann, Sadeghi.
5. Obfuscation techniques for enhancing software security, by Christian Collberg, Clark Thomborson and Douglas Low, US Patent 6,668,325, assigned to InterTrust Inc of Sunnyvale CA (USA), filed 9 June 1998, issued 23 December 2003. See also WO 99/01815A1, EP0988591A1, CA2293650AA, AU7957998A1, JP2002514333T2, CN1260055T.
6. Software watermarking techniques, published international patent application WO 99/64973, by Christian Collberg and Clark Thomborson, assigned to Auckland UniServices Ltd, 16 December 1999. See also AU4535699A1, and US 2011/021418 (filed 15 November 2010, published 1 September 2011).

Articles in Conference Proceedings:

1. Axiomatic and Behavioural Trust, by Clark Thomborson, in Trust and Trustworthy Computing (Trust 2010, 21-23 June 2010, Berlin, Germany), LNCS 6101, Springer, 2010.
2. A security model for VoIP Steganography, by Zhiwei Yu, Clark Thomborson, Chaokun Wang, Junning Fu, and Jianmin Wang, in Proc. of the First International Conference on Multimedia Information Networking and Security (MINES 2009, Wuhan, Hubei, China, 17-20 November 2009), pp. 35-40.
3. A semi-dynamic multiple watermarking scheme for Java applications, by Changjiang Zhang, Jianmin Wang, Clark Thomborson, Chaokun Wang, and Christian Collberg, in Proc. of the 9th ACM Workshop on Digital Rights Management (DRM 2009, Chicago IL, USA, 9 November 2009), pp. 59-72.
4. Preliminary Security Specification for New Zealand's igovt System, by Yu-Cheng Tu and Clark Thomborson, in Information Security 2009 (Proc. 7th AISC, Wellington, January 2009), CRPIT vol. 98, pp. 79-88, 2009. Press coverage: Researcher questions government security analysis, by Stephen Bell, ComputerWorld, 16 Feb 2009.
5. Passwords and Perceptions, by Gilbert Notoatmodjo and Clark Thomborson, Information Security 2009 (Proc. 7th AISC, Wellington, January 2009), CRPIT vol. 98, pp. 71-78, 2009.
6. A Model for New Zealand's Identity Verification Service, by Clark Thomborson, in Trusted Computing - Challenges and Applications (Proc. TRUST 2008, Villach, Austria, 12 March 2008), LNCS 4968, 2008. Presentation slides.
7. Slicing obfuscations: Design, correctness, and evaluation, by Anirban Majumdar, Stephen Drape, and Clark Thomborson, in Proceedings of the 2007 ACM Workshop on Digital Rights Management (DRM '07, Alexandria VA USA, 29 October 2007), pp. 70-81, 2007.
8. Specifying imperative data obfuscations, by Stephen Drape, Clark Thomborson, and Anirban Majumdar, in Information Security (Proc. 10th ISC2007, Valparaiso, Chile, 9-12 October 2007), LNCS Vol. 4779, Springer, pp. 299-314, 2007. Acceptance rate: 29/116.
9. Metrics-based evaluation of slicing obfuscations, by Anirban Majumdar, Stephen Drape, and Clark Thomborson, in The Third International Symposium on Information Assurance and Security (Proc. IAS 2007, Manchester, UK, 29-31 August 2007), pp. 472-477, 2007.
10. Slicing aided design of obfuscating transforms, by Stephen Drape, Anirban Majumdar, and Clark Thomborson, in 6th IEEE/ACIS International Conference on Computer and Information Science (Proc. ICIS 2007, Melbourne, 11-13 July 2007), pp. 1019-1024, 2007.
11. An appropriate design for trusted computing and digital rights management (abstract), in 2007 Xiangshan Science Conference on Social Computing (Proc. XSCSC2007, Beijing, 8 April 2007), preparatory group of the 299th Academic Workshop of the Xiangshan Science Conference Series, Institute of Automation, Chinese Academy of Sciences, p. 23, 2007.
12. On evaluating obfuscatory strength of alias-based transforms using static analysis, by Anirban Majumdar, Antoine Monsifrot, and Clark Thomborson, 14th International Conference on Advanced Computing and Communication (Proc. ADCOM 2006, Mangalore India, 20-23 December 2006), IEEE, pp. 605-610, 2007.
13. A survey of control-flow obfuscations, by Anirban Majumdar, Clark Thomborson, and Stephen Drape, Information Systems Security (Proc. Second International Conference on Information Systems Security, Kolkata, India, 17-21 December 2006), LNCS 4332, pp. 353-356, 2006.
14. Interpreting opacity in the context of information-hiding and obfuscation in distributed systems, by Anirban Majumdar and Clark Thomborson, in Proc. IEEE TENCON 2006 (Hong Kong, China, 14-17 November 2006), 4 pp., 2006.
15. Governance of trusted computing, by Clark Thomborson and Matt Barrett, best paper award in IT Audit - Strategic Measures for Performance, Value & Quality (Proc. 2006 IT Governance Conference, Auckland, New Zealand, 13-15 November 2006), ISBN 1-877314-60-9, pp. 15-26, 2006.
16. B2B e-commerce security modeling: a case study, by Han Zhang, William Zhu, Clark Thomborson, Gerald Weber, and Barry Dowdeswell, in 2006 International Conference on Computational Intelligence and Security (CIS'2006, Guangzhou, China, 3-6 November 2006), LNCS 4456, pp. 1549-1554, 2006.
17. Recognition in software watermarking, by William Zhu and Clark Thomborson, First ACM Workshop on Content Protection and Security, pp. 29-36, 27 October 2006. Acceptance rate: 35%. This workshop was held in conjunction with ACM Multimedia 2006, Santa Barbara, California (USA).
18. A survey-based analysis of HIPAA security requirements, by Jinho Lee, Clark Thomborson, and Gary Guest, paper G19 in HINZ Primary Care and Beyond: Building the e-Bridge to Integrated Care (Auckland, 9-11 August 2006), Eds: Christopher Peck & Jim Warren, Health Informatics New Zealand (HINZ) & Health Informatics Society of Australia Ltd (HISA), ISBN 0 9751013 7 4, 2006. To appear, subject to editorial revision, in a special issue of Health Care and Informatics Review Online.
19. Extraction in software watermarking, by William Zhu and Clark Thomborson, in Proc. 8th workshop on Multimedia and Security (MM&Sec '06, Geneva, Switzerland, 26-27 September 2006), 175-181, 2006.
20. Frameworks built on the trusted platform module, by Matt Barrett and Clark Thomborson, in 30th Annual International Computer Software and Applications Conference (COMPSAC 2006, Chicago IL USA, 17-21 September 2006), 59-62, 2006.
21. Algorithms to watermark software through register allocation, by William Zhu and Clark Thomborson, in First International Conference on Digital Rights Management: Technology, Issues, Challenges and Systems (DRMTICS 2005, Sydney, Australia, 31 Oct. - 2 Nov. 2005), ed. Safavi-Naini and Yung, LNCS 3919, pp. 180-191, July 2006.
22. Obfuscate arrays by homomorphic functions, by William Zhu, Clark Thomborson, and Fei-Yue Wang, in IEEE Granular Computing 2006 (GrC 06), Atlanta GA (USA) pp. 770-773, May 2006.
23. Applications of Homomorphic Functions to Software Obfuscation, by William Zhu, Clark Thomborson, and Fei-Yue Wang, in Proc. Workshop on Intelligence and Security Informatics (WISI'06, Singapore), LNCS 3917, Springer-Verlag, pp. 152-3, April 2006.
24. Manufacturing Opaque Predicates in Distributed Systems for Code Obfuscation, by Anirban Majumdar and Clark Thomborson, in Proc. Twenty-Ninth Australasian Computer Science Conference (ACSC 2006, Hobart Australia), CRPIT Vol. 48, eds. V. Estivill-Castro and G. Dobbie, ACS, pp. 187-196, January 2006.
25. A provable scheme for homomorphic obfuscation in software security, by William Zhu and Clark Thomborson, in Proc. IASTED International Conference on Communication, Network, and Information Security (CNIS 2005, Phoenix AZ, USA), ed. M.H. Hamza, ACTA Press, Vol. 499, ISBN 0-88986-537-X, pp. 208-212, December 2005. Submitted version.
26. Securing mobile agents control flow using opaque predicates, by Anirban Majumdar and Clark Thomborson, in Knowledge-Based Intelligent Information and Engineering Systems (9th International Conference, KES 2005, Melbourne AU), Lecture Notes in Computer Science, Volume 3683, Springer-Verlag, pp. 1065-71, August 2005.
27. A survey of software watermarking, by William Zhu, Clark Thomborson, and Fei-Yue Wang, in Intelligence and Security Informatics: IEEE International Conference on Intelligence and Security Informatics (ISI 2005, Atlanta, GA, USA, May 2005), LNCS vol 3495, Springer-Verlag, pp. 454 - 458, April 2005.
28. On the QP algorithm in software watermarking, by William Zhu and Clark Thomborson, in Intelligence and Security Informatics: IEEE International Conference on Intelligence and Security Informatics (ISI 2005, Atlanta, GA, USA, May 2005), LNCS vol 3495, Springer-Verlag, pp. 646 - 647, April 2005.
29. On the use of opaque predicates in mobile agent code obfuscation, by Anirban Majumdar and Clark Thomborson, in Intelligence and Security Informatics: IEEE International Conference on Intelligence and Security Informatics (ISI 2005, Atlanta, GA, USA, May 2005), LNCS vol 3495, Springer-Verlag, pp. 648 - 649, April 2005.
30. Using NGSCB to mitigate existing software threats, by Matthew Barrett and Clark Thomborson, in Certification and Security in Inter-Organizational E-Services, eds. Narelli and Talamo, IFIP Vol. 177, Springer, ISBN 0-387-25087-5, pp. 55-74, 2005. See also Using NGSCB to mitigate existing software threats (preliminary version).
31. Security improvements for encrypted interpretation, by Akito Monden, Antoine Monsifrot, and Clark Thomborson, Workshop on Application Specific Processors (WASP-2004). Published in the WASP-2004 Digest (distributed to workshop participants), pp. 19-26, 2004.
32. Update patch management systems: a protocol taxonomy with security implications, by Andrew Colarik, Clark Thomborson, and Lech Janczewski, in 19th IFIP WG 11.1 Annual Working Conference on Information Security Management at WCC'04, Building the Information Society, IFIP International Federation for Information Processing Vol. 156, Jacquart, Reni (Ed.), Kluwer, ISBN 1-4020-8156-1, pp. 67-80, 2004.
33. Threading software watermarks, by Jasvir Nagra and Clark Thomborson, Proc. 6th International Workshop on Information Hiding (IH 2004), LNCS 3200, Springer-Verlag, pp 208-233, 2004. Preprint version.
34. A framework for obfuscated interpretation, by Akito Monden, Antoine Monsifrot, and Clark Thomborson. In Proc. Second Australasian Information Security Workshop (AISW2004), ed. P. Montague and C. Steketee, ACS, CRPIT Vol. 32, pp. 7-16, 2004.
35. Tamper-proofing software watermarks, by Clark Thomborson, Jasvir Nagra, Ram Somaraju, and Charles He. In Proc. Second Australasian Information Security Workshop (AISW2004), ed. P. Montague and C. Steketee, ACS, CRPIT Vol. 32, pp. 27-36, 2004.
36. Graph-based approaches to software watermarking, by Christian Collberg, Stephen Kobourov, Edward Carter, and Clark Thomborson, in Graph-Theoretic Concepts in Computer Science (Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science, WG'2003, 18-21 June 2003, Elspeet, the Netherlands), Lecture Notes in Computer Science 2880, Springer-Verlag, October 2003, pp. 156-167.
37. Folklore confirmed: reducible flow graphs are exponentially larger, by Larry Carter, Jeanne Ferrante, and Clark Thomborson, Proc. of 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'03), ACM, 106-114, January 2003.
38. Recommendations for internet safety at home, by Clark Thomborson, in Proc. NetSafe: Society, Safety and the Internet, ed. John Hosking, Technical Report 172, Department of Computer Science, University of Auckland, pp. 118-123, February 2002. Presentation slides.
39. A functional taxonomy for software watermarking, by Jasvir Nagra, Clark Thomborson, and Christian Collberg, in Proc. 25th Australasian Computer Science Conference 2002, ed. MJ Oudshoorn, ACS, pp. 177-186, January 2002.
40. Measuring data cache and TLB parameters under Linux, by Clark Thomborson and Yuanhua Yu, in 2000 Symposium on Performance Evaluation of Computer and Telecommunication Systems, Society for Computer Simulation International, Vancouver BC, 383-390, July 2000.
41. Data cache parameter measurements, by Li Enyou and Clark Thomborson, Proc. IEEE International Conference on Computer Design (ICCD'98), pp. 376-383, October 1998.
42. NZ needs to invest heavily in research, by Clark Thomborson, NZInfoTech Weekly, 15 March 1999.
43. Software watermarking: models and dynamic embeddings, by Christian Collberg and Clark Thomborson, POPL 99, January 1999, 311-324.
44. Evaluation of gigabit Ethernet with Java/HORB, by Y. Yasu, H. Fujii, Y. Igarishi, E. Inoue, H. Kodama, A. Manabe, Y. Watase, Y. Nagasaka, M. Nomachi, S. Hirano, H. Takagi, K. Shudo, T. Arai, L. Sarmenta, C. Thomborson, R. Nicolescu, and M. Duc, Proc. CHEP'98, Chicago USA, September 1998.
45. Breaking abstractions and unstructuring data structures, by Christian Collberg, Clark Thomborson and Douglas Low, Proc. IEEE International Conference on Computer Languages (ICCL'98), pp. 28-38, May 1998. DOI: 10.1109/ICCL.1998.674154.
46. Manufacturing cheap, resilient, and stealthy opaque constructs, by Christian Collberg, Clark Thomborson and Douglas Low, Proc. 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'98), pp. 184-196, January 1998.
47. The economics of large-memory computations, by Clark Thomborson, Algorithms and Architectures for Parallel Processing, Proc. 1997 3rd International Conference (ICA3PP'97), eds. Goscinski, Hobbs, and Zhou, World Scientific, pp. 579-592, December 1997.
48. CS gender gap still a problem, by Clark Thomborson, Computing Research News, pp. 2-3, November 1995. Please see my website for an updated version and data files.
49. Rectilinear Steiner tree minimization on a workstation, by Clark Thomborson, Bowen Alpern, and Larry Carter, Computational Support for Discrete Mathematics: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 15, eds. N. Dean and G.E. Shannon, American Mathematical Society, pp. 119-136, 1994.
50. Tools for randomized experimentation, by Clark Thomborson, Proc. Interface '93: the 25th Symposium on the Interface between Computing Science and Statistics, The Interface Foundation of North America, 412-416, 1994.
51. Towards a visualization tool for performance evaluation (abstract only), SuperComputing 1993, Portland, November 1993.
52. Why are fewer females obtaining bachelor's degrees in computer science?, by Clark Thomborson, SIGACT News 24:3, 114-116, September 1993. Please see my website for an Updated version and data files.
53. Optimizing carry lookahead adders for semicustom CMOS, by Clark Thomborson and Yi Sun, Proc. Third Great Lakes Symposium on VLSI, IEEE Computer Society, 119-122, March 1993.
54. A probably fast, provably optimal algorithm for rectilinear Steiner trees (extended abstract), by Linda L. Deneen, Gary M. Shute, and Clark Thomborson, to appear in the Fourth Canadian Conference on Computational Geometry, 1992.
55. Gate array global routing using a neural network, by Yanzhang Lu and Clark Thomborson, Proc. Artificial Neural Networks in Engineering, eds. Dagli, Kumara, and Shin, 895-900, November 1991.
56. Delay optimization of carry-skip adders and block carry-lookahead adders, by Pak K. Chan, Martine D.F. Schlag, Clark D. Thomborson, and Vojin G. Oklobdzija, Proc. 10th IEEE Symposium on Computer Arithmetic, 154-164, June 1991.
57. V.42bis and other Ziv-Lempel variants (abstract only), by Clark D. Thomborson, Proc. Data Compression Conference, IEEE, p. 460, April 1991.
58. Systolic Designs for a Move-To-Front Text Compressor (reprinted from SPAA 89, by Clark D. Thomborson and Belle W.-Y. Wei, Computer Architecture News 19:1, 53-60, March 1991.
59. A dualizable representation for general graphs, by Clark D. Thomborson, Linda L. Deneen, and Gary M. Shute, Graph Theory, Combinatorics, and Applications (Proc. Sixth International Conference on the Theory and Applications of Graphs, 1988), ed. Y. Alavi et al., John Wiley and Sons, New York, 343-357, 1991.
60. Asymptotically tight bounds for computing with faulty arrays of processors (extended abstract), by C. Kaklamanis, A.R. Karlin, F.T. Leighton, V. Milenkovic, P. Raghavan, S. Rao, C. Thomborson, and A. Tsantilas, Proc. 31st Annual Symposium on Foundations of Computer Science, 285-296, November 1990. DOI: 10.1109/FSCS.1990.89547.
61. Enhancements to Ziv-Lempel Data Compression, by Clyde Rogers and Clark D. Thomborson, COMPSAC 89: Proc. 13th International Computer Software and Applications Conference, IEEE, 324-330, 1989.
62. Systolic Designs for a Move-To-Front Text Compressor, by Clark D. Thomborson and Belle Wei, Proc. ACM Symposium on Parallel Algorithms and Architectures, 283-290, 1989.
63. SuperCrystal: a computer program for MOS VLSI timing analysis, by Antony P-C Ng, Arvind Raghunathan, and Clark D. Thompson, VLSI-87, ed. C.H. Séquin, Elsevier Science Publishers B.V. (North-Holland), IFIP, 337-352, 1988.
64. Computing a rectilinear Steiner minimal tree in n^(O\sqrt(n)) time, by Clark Thomborson, Linda L. Deneen, and Gary M. Shute, in Mathematical Research, volume 38: Parallel Algorithms and Architectures (Proc. International Workshop on Parallel Algorithms and Architectures, Suhl (GDR), May 1987), eds. Albrecht et al., Akademie-Verlag Berlin, 176-183, 1987.
65. A language for describing rectilinear Steiner tree configurations, by Antony P-C Ng, Prabhakar Raghavan, and Clark Thompson, 1986 ACM Design Automation Conference, 659-662, June 1986.
66. Signal delay in RC trees with charge sharing or leakage, by Arvind Raghunathan and Clark Thompson, Proc. 19th Annual Asilomar Conference on Circuits, Systems, and Computers, IEEE Computer Society, 557-560, November 1985.
67. On the area-time optimal design of l-selectors, by Clark Thompson and Hiroto Yasuura, Proc. 19th Annual Asilomar Conference on Circuits, Systems, and Computers, IEEE Computer Society, 365-368, November 1985. PDF and abstract are available from the IEEE Explore Collection, July 2001.
68. Time-optimal design of a CMOS adder, by Belle W. Y. Wei, Clark Thompson, and Yih-farn Chen, Proc. 19th Annual Asilomar Conference on Circuits, Systems, and Computers, IEEE Computer Society, 186-191, November 1985.
69. Provably good routing in graphs: regular arrays, by Prabhakar Raghavan and Clark Thompson, Proc. 17th Annual ACM Symp. on Theory of Computing, 79-87, May 1985.
70. An efficient implementation of search trees on \ceiling{log n + 1} processors by Michael J. Carey and Clark D. Thompson, Algorithmically Specialized Parallel Computers, ed. Lawrence Snyder et al., Academic Press, ISBN 0126541302, pp. 37-46, 1985.
71. Sorting records in VLSI, by Michael J. Carey, Paul M. Hansen, and Clark D. Thompson, Algorithmically Specialized Parallel Computers, ed. Lawrence Snyder et al., Academic Press, 27-36, 1985.
72. Area-time complexity for VLSI, in Artificial Intelligence and Information-Control Systems of Robots, ed. I. Plander, Elsevier Science Publishers, 373-382, 1984.
73. On the energy-time-area cost of a memory access, Proc. WG'83 Workshop on Graphtheoretic Concepts in Computer Science, Osnabrück, Trauner-Verlag, 354-369, 1984.
74. On estimating the performance of VLSI circuits, by Clark Thompson and Prabhakar Raghavan, MIT VLSI Conference, 34-44, January 1984.
75. Global wire routing in two-dimensional arrays, by R.M. Karp, F.T. Leighton, R. Rivest, C. Thompson, V.V. Vazirani, and U.V. Vazirani, 24th Annual Symp. on Foundations of Computer Science, 453-459, November 1983.
76. The VLSI complexity of sorting, Proc. C-MU Conf. on VLSI Systems and Computations, 108-119, Prentice-Hall, 1981.
77. Fourier transforms in VLSI, Proc. ICCC-80, 1046-1051, October 1980.
78. Area-time complexity for VLSI, Proc. 11th Annual ACM Symp. on Theory of Computing, 81-88, April 1979.
79. Area-time complexity for VLSI, Proc. 1979 Cal Tech Conf. on VLSI, 495-508, January 1979.
80. Direct VLSI implementation of combinatorial algorithms, by L. J. Guibas, H. T. Kung, and C. D. Thompson, Proc. 1979 Cal Tech Conf. on VLSI, 509-525, January 1979.
81. On the average number of maxima in a set of vectors and applications, by J. L. Bentley, H. T. Kung, M. Schkolnick, and C. D. Thompson, Proc. 15th Annual Allerton Conf. on Communication, Control, and Computing, September 1977.
82. Sorting on a mesh-connected parallel computer, by C. D. Thompson and H. T. Kung, Proc. 1976 ACM Symp. on Theory of Computing, 58-64, May 1976.

Software Releases:

1. Mrandom version 3.0, by Clark Thomborson and Robert Plotkin, available by anonymous ftp from http://www.cs.auckland.ac.nz/~cthombor/Mrandom/V3.0, June 1993.
2. Mrandom version 2.3, by Clark Thomborson, September 1992. No longer available by anonymous ftp.
3. Mrandom: a random number generator with persistent state, by Clark Thomborson, Comp.sources.unix, Volume 25, Issue 23, December 1991.

Chapters in Books:

1. A Framework for System Security, by Clark Thomborson, in Handbook of Information and Communication Security, eds. P. Stavroulakis and M. Stamp, Springer, 6 March 2010. Word cloud, produced by Wordle.
2. Incredible codes, by Clark Thomborson and Bob Doran, in Incredible Science, ed. Alison Brook, Puffin Books, Penguin, pp. 16-17, July 2005.
3. The role of military funding in academic computer science, by Clark D. Thomborson, in Computers in battle - will they work?, eds. Bellin and Chapman, Harcourt Brace Jovanovich, 283-296, 1987.

Technical Reports:

1. Dynamic graph-based software watermarking, by Christian Collberg, Clark Thomborson, and Gregg M. Townsend, Technical report TR04-08, Computer Science Department, University of Arizona (USA), 46 pp., 28 April 2004.
2. Obfuscated instructions for software protection, by Akito Monden, Antoine Monsifrot, and Clark Thomborson, Information Science Technical Report, NAIST-IS-TR2003013, ISSN 0919-9527, Graduate School of Information Science, Nara Institute of Science and Technology (Japan), November 2003.
3. Watermarking, tamper-proofing, and obfuscation - Tools for software protection, by Christian Collberg and Clark Thomborson, Computer Science Department Technical Report 170, University of Auckland, February 2000, 15 pp. Identical to Computer Science Department Technical Report 2000-03, University of Arizona (USA).
4. Evaluation of gigabit Ethernet with Java/HORB, by Y. Yasu, H. Fujii, Y. Igarishi, E. Inoue, H. Kodama, A. Manabe, Y. Watase, Y. Nagasaka, M. Nomachi, S. Hirano, H. Takagi, K. Shudo, T. Arai, L. Sarmenta, C. Thomborson, R. Nicolescu, and M. Duc, KEK Preprint 98-181, KEK High-Energy Accelerator Research Organization, Tokyo, Japan, 8 pp., November 1998. Also appears as CITR Technical Report TR-41, February 1999.
5. On the limits of software watermarking, by Christian Collberg and Clark Thomborson, Computer Science Department Technical Report number 164, University of Auckland, 14 pp., August 1998.
6. A taxonomy of obfuscating transformations, by Christian S. Collberg, Clark Thomborson and Douglas Low, Computer Science Department Technical Report number 148, University of Auckland, 36 pp., July 1997.
7. When Virtual Memory Isn't Enough, by Clark Thomborson, Computer Science Department Technical Report number 136, University of Auckland, 21 pp., November 1996.
8. An Introduction to mrandom 3.0, by Clark Thomborson, UMD Computer Science Department Technical Report 93-02, 36 pp., July 1993.
9. Rectilinear Steiner tree minimization on a workstation, by Clark Thomborson, Bowen Alpern, and Larry Carter, IBM TJ Watson Research Center report RC 17680 (#77873), 15 pp., February 11, 1992.
10. Does your computation belong on a supercomputer?, by Clark Thomborson, UMD Computer Science Department Technical Report 91-04, 14 pp., May 1991.
11. V.42bis and other Ziv-Lempel variants, by Clark D. Thomborson, UMD Computer Science Department Technical Report 91-02, 13 pp., April 1991.
12. When is a supercomputer no better than a workstation?, by Clark D. Thomborson and James L. Fenno, University of Minnesota Supercomputer Institute Research Report UMSI 90/103R, (identical to UMD Computer Science Department Technical Report 90-5), 14 pp., June 1990.
13. When is a Cray-2 no better than a workstation?, by Clark D. Thomborson and James L. Fenno, UMD Computer Science Department Technical Report 89-10, 9 pp., September 15, 1989.
14. Enhancements to Ziv-Lempel data compression, by Clyde Rogers and Clark D. Thomborson, UMD Computer Science Department Technical Report 89-2, 13 pp., January 1989.
15. An O(n log n) plane-sweep algorithm for L₁ and L_¥ Delauaney triangulations, by Gary M. Shute, Linda L. Deneen, and Clark D. Thomborson, UMD Computer Science Mathematics and Statistics Technical Report 87-5, 30 pp., September 1987.
16. Multiterminal global routing: a deterministic approximation scheme, by Prabhakar Raghavan and Clark Thompson, IBM TJ Watson Research Center report RC 12806 (#57605), 11 pp., June 1987.
17. Time-optimal design of a CMOS adder, by Belle W. Y. Wei, Clark Thompson, and Yih-farn Chen, UCB/CSD 86/252, 13 pp., August 1985.
18. A minimum-area circuit for l-selection, by Pavol Duris, Ondrej Sýkora, Clark Thompson, and Imrich Vrto, UCB/CSD 85/244, 13 pp., June 1985.
19. Randomized rounding: a technique for provably good algorithms and algorithmic proofs, by Prabhakar Raghavan and Clark Thompson, UCB/CSD 85/242, 14 pp., June 1985.
20. Signal delay in RC trees with charge sharing or leakage, by Arvind Raghunathan and Clark Thompson, UCB/CSD 85/243, 23 pp., June 1985.
21. Randomized routing in gate arrays, by Prabhakar Raghavan and Clark Thompson, UCB/CSD 84/202, 17 pp., September 1984.
22. On estimating the performance of VLSI circuits, by Clark Thompson and Prabhakar Raghavan, UCB/CSD 84/138, 18 pp., September 1983.
23. VLSI implementation of digital Fourier transforms, by A. Despain, C. Séquin, C. Thompson, E. Wold, and D. Lioupis, UCB/CSD 82/111, 85 pp., November 1982.
24. Fourier transforms in VLSI, UCB/CSD 82/105, 29 pp., September 1982.
25. RESST: A VLSI implementation of a record-sorting stack, by Michael J. Carey, Paul M. Hansen, and Clark D. Thompson, UCB/CSD 82/102, 26 pp., April 1982.
26. An efficient implementation of search trees on \ceiling{log n + 1} processors, by Michael J. Carey and Clark D. Thompson, UCB/CSD 82/101, 16 pp., April 1982.
27. The VLSI complexity of sorting, UCB/ERL M82/5, 37 pp., February 1982.
28. Fourier transforms in VLSI, UCB/ERL M80/51, 15 pp., October 1980.
29. A Complexity Theory for VLSI, Ph.D. dissertation, Carnegie-Mellon University, Computer Science Dept. Technical Report CMU-CS-80-140, 131 pp., August 1980.
30. Generalized connection networks for parallel processor intercommunication, C-MU Tech. Report, 15 pp., May 1977.
31. On the average number of maxima in a set of vectors and applications, by J. L. Bentley, H. T. Kung, M. Schkolnick, and C. D. Thompson, C-MU Tech. Report, 16 pp., July 1977.
32. Sorting on a mesh-connected parallel computer, by C. D. Thompson and H. T. Kung, C-MU Tech. Report, 27 pp., March 1976.
33. Depth perception in stereo computer vision, Stanford AIM-268 (STAN-CS-75-521), 15 pp., October 1975.

Selected talks, colloquia, etc.

1. Networked Identity, oral presentation, Macquarie University Security Research Group Seminar (INSS) 8 February 2012.
2. Networked Identity, oral presentation to the End to End Trust group at Microsoft (Redmond, WA, USA), 13 December 2011.
3. Networked Identity, oral presentation at Yahoo! Research (Sunnyvale, CA, USA), 9 December 2011.
4. Security through Obscurity, guest lecture in Mark Stamp's Topics in Information Security course at San Jose State University (California, USA), 7 December 2011.
5. Obfuscation and Tamperproofing, presentation at Tsinghua University, School of Software, as a member of their Chair Professor Group of Software Theory, 19 March 2010.
6. Techniques for Software Watermarking and Fingerprinting, presentation at Tsinghua University, School of Software, as a member of their Chair Professor Group of Software Theory, 17 March 2010.
7. Security Modelling: What is Security?, presentation at Tsinghua University, School of Software, as a member of their Chair Professor Group of Software Theory, 12 March 2010.
8. Software Security for the Cloud, presentation at Tsinghua University, School of Software, as a member of their Chair Professor Group of Software Theory, 11 March 2010.
9. Limited Autonomy, by Clark Thomborson, keynote address at the Eighth International Conference on Dependable, Autonomic and Secure Computing (DASC-09), Chengdu, China, 12-14 December 2009.
10. Sensible Sensors: Privacy and smart sensor technologies, moderated panel discussion at KPMG Auckland, 6 May 2009.
11. Foundation for System Security, invited lecture at the 7th Australasian Information Security Conference, Wellington, NZ, 20 January 2009.
12. A Model for New Zealand's Identity Verification Service, by Clark Thomborson, presentation at TRUST 2008, Villach, Austria, 12 March 2008.
13. The Promise and Peril of Trusted Computing in Governmental Systems, by Clark Thomborson, presentation to Educational Event at TRUST 2008, Villach, Austria, 11 March 2008. Also presented to the Institute of Automation, Chinese Academy of Sciences, 20 March 2008.
14. Could Software Watermarks Express Both Rules and Assurances?, by Clark Thomborson, presentation to ReTrust workshop at TRUST 2008, Villach, Austria, 11 March 2008.
15. NZ taking part in cyber terrorist exercise, excerpt from phone interview included in TV3 news broadcast, 7:38pm 9 March 2008.
16. Exploring the Weakest Link: A Study of Personal Password Security, by Gilbert Notoatmodjo and Clark Thomborson, presentation at New Zealand Information Security Forum, Auckland, 20 December 2007.
17. Profiling danger in identity system, interview by Claire McEntee, The Dominion Post (Wellington, NZ), 10 December 2007.
18. Interview on Radio Live regarding the police interview of AKILL in the Waikato, 12:45pm to 12:50pm, 30 November 2007.
19. Architecting Systems to Protect Intellectual Property, by Clark Thomborson, presentation at an NZTE China Workshop, Auckland NZ, 16 November 2007.
20. Protecting Software with Watermarks, presentation by Clark Thomborson to a Connect Workshop run by UniServices at Microsoft House, Auckland, 18 October 2007.
21. The Jericho Forum's Architecture for De-Perimeterised Security, keynote address by Clark Thomborson at Practical IT Governance in a Connected World (Oceania CACS 2007), Auckland NZ, 9-12 September 2007.
22. Enterprise Content Management in a De-Perimeterised Environment, Jericho's Architecture for De-Perimeterised Security, by Clark Thomborson, ISACA/IIA Lunchtime Education Session, 27 July 2007, Wellington NZ.
23. Methods for Software Protection, keynote lecture at The International Forum on Computer Science and Advanced Software Technology, Jiangxi Normal University, 10-11 June 2007.
24. The Future of Enterprise Content Management (in a De-perimeterised Environment), presentation at a Microsoft Enterprise Content Management event, Fronde, Level 7, 131 Queen Street, 4:30 to 6pm, 2 May 2007.
25. Government Policy on Trusted Computing and Digital Rights Management: A View from New Zealand and Methods for Software Protection, seminars hosted by Antony Ng at DSO National Laboratories, Singapore, 10 April 2007.
26. An Appropriate Design for Trusted Computing and Digital Rights Management, keynote speech at the 2007 Xiangshan Science Conference on Social Computing (XSCSC2007), Institute of Automation, Chinese Academy of Sciences, 8 April 2007.
27. Trusted Computing and Digital Rights Management in a De-perimeterised Environment, seminar to Dennis Soong's group at Lenovo R&D, Beijing, 5 April 2007.
28. An Appropriate Design for Trusted Computing and Digital Rights Management, seminar to Wenbo Mao's group at HP Labs, Beijing, 4 April 2007; to Prof Dongdai Lin's group at the State Key Laboratory of Information Security (SKLOIS) at the Institute of Software, Beijing, 3 April 2007; Zheng Zhang's group at Microsoft Research Asia, Beijing, 30 March 2007; and to Prof CHEN Zhong's group at Peking University, Beijing, 9 April 2007.
29. What is Security? and An Appropriate Design for Trusted Computing and Digital Rights Management, seminars hosted by Jishou Ruan at Nankai University on 2 April 2007, and by Andy Yao at Tsinghua University on 29 March 2007.
30. How TPMs Can (and Should) Control Copyright, presentation at the "Tackling the Copyright Amendment Bill" workshop, InternetNZ, Wellington, 13 February 2007.
31. An Appropriate Design for Trusted Computing and Digital Rights Management, presentation to the e-Government Unit of the State Services Commission of New Zealand, 8 December 2006.
32. Defensible Digital Boundaries, moderated panel discussion with Bojan Zdrnja, Peter Gutmann, Darren Bilby, Andrew Lee, and Gordon Grant, at AVAR'06, 5 December 2006.
33. Governance of trusted computing, by Clark Thomborson, seminar to the TRUST group at UC Berkeley, 25 October 2006.
34. Trusted Computing: Open, Closed, or Both?, by Clark Thomborson, Trusted Systems Laboratory at HP Bristol, 24 April 2006. An earlier version of this slideshow was presented to the Applied Data Security Group at Bochum University, 21 April 2006; as a Computer Science Department Seminar, U of Auckland, 6 April 2006; and to the New Zealand Information Security Forum, Auckland, 9 March 2006. This slideshow was also presented at a research seminar on 28 April 2006 at Cardiff University.
35. Interview on the "Credit card fraud" segment of Morning Report, Radio New Zealand, 8:40am to 8:43am, 24 November 2005.
36. A survey of software watermarking, invited lecture at the Institute of Automation, Chinese Academy of Sciences, Beijing, 5 May 2005.
37. Interview on the "Hackers" segment of TV2's Flipside show, 28 September 2004.
38. NGSCB - A new tool for securing applications, by Matt Barrett and Clark Thomborson, seminar at the New Zealand Information Society Forum, 12 August 2004. Presentation slides of Matt Barrett and Clark Thomborson.
39. New techniques for software protection, by Jasvir Nagra and Clark Thomborson, Computer Science Department Seminar, University of Auckland, 20 May 2004. Also presented at Cloakware Corporation, Ottawa (Canada), 26 May 2004, and at Digital Security Seminar, Carleton University, Ottawa (Canada), 27 May 2004.
40. Methods for software protection, Stanford Security Seminar, Stanford University, 2 March 2004; also guest lecture in Mark Stamp's CS 265 class on Cryptography and Computer Security, San Jose State University, 1 March 2004.
41. A framework for obfuscated interpretation, Microsoft Research Tech Talk, Redmond WA (USA), 24 November 2003.
42. Methods for software protection, Computing and Software Systems Seminar, University of Washington, Tacoma WA (USA), 19 November 2003.
43. A framework for obfuscated interpretation, Computer Science Colloquium, University of Arizona, Tucson AZ (USA), 6 November 2003.
44. Applications of graph theory to software security, invited lecture at USP 2003 Conference on Applied Algebra, Cryptography and Information Technology, Suva, Fiji, 2-6 June 2003.
45. Interview on the "Privacy invaders" segment of TV2's Flipside show, 5 June 2003.
46. Challenges in software security (90 KB file in PPS format), lecture by Clark Thomborson at the 1 March 2001 meeting of the New Zealand Information Security Forum.
47. Software security, a seminar presented at the 21st Anniversary Symposium, Computer Science Department, University of Auckland, 14 February 2001.
48. The economics of large-memory computations, Computer Science colloquium, University of Arizona (USA), 18 November 1999.
49. An open letter to the Foresight Project on the need for strategically targeted basic research in New Zealand, signed by 54 academic computer scientists. Mentioned in InfoTech Weekly, 15 February 1999.
50. Strategically targeted basic research in New Zealand?, Computer Science colloquium, University of Waikato 3 December 1998, University of Auckland 8 December 1998.
51. Computing: the next twenty years, IEEE Computer Society, Auckland Branch, 14 September 1998.
52. Ways to excel as a stage-4 student (PowerPoint presentation for a 20-minute seminar delivered 26 Feb 99 to Computer Science students at the SMIS Graduate Workshop).
53. Towards an economic theory for large-memory computations, Computer Science Department, Otago University, Dunedin NZ, 21 March 1997; and Computer Science Department, University of Canterbury, Canterbury NZ, 19 March 1997.
54. Why aren't there more women computer scientists?, Computer Science Department, Otago University, Dunedin NZ, 21 March 1997; Centre for Computing and Biometrics, Lincoln University, Lincoln NZ, 20 March 1997; and Computer Science Department, University of Canterbury, Canterbury NZ, 19 March 1997.
55. Modelling hierarchical memory, Computer Science Department, Victoria University, Wellington NZ, 24 October 1996.
56. Why aren't there more women computer scientists?, Computer Science Department, Victoria University, Wellington NZ, 24 October 1996.
57. Modelling hierarchical memory, Computer Science Department, Massey University, Palmerston North NZ, 23 October 1996.
58. Why aren't there more women computer scientists?, Computer Science Department, Massey University, Palmerston North NZ, 23 October 1996.
59. Modelling hierarchical memory, Computer Science and Engineering Department colloquium, University of California at San Diego, 9 September 1996.
60. Modelling hierarchical memory, Computer Science Department colloquium, Waikato University (NZ), 6 August 1996.
61. Finding a good job as a programmer, Computer Science Department seminar, Auckland University (NZ), 8 June 1995.
62. LMH: a programmer's interface to the linearized memory hierarchy, Computer Science Department colloquium, Auckland University (NZ), 7 June 1995.
63. Why aren't there more women computer scientists?, Computer Science Department seminar, Auckland University (NZ), 6 June 1995.
64. Why are fewer women majoring in computer science these days?, informal seminar/discussion, Computer Professionals for Social Responsibility, Minneapolis, 9 May 1995.
65. A programmer's interface to the memory hierarchy, Computer Science department colloquium, U of Illinois at Urbana-Champaign, 1 May 1995.
66. Linearizing the memory hierarchy, Midwest Theory Day, U of Illinois at Urbana-Champaign, 29 April 1995.
67. Linearizing the memory hierarchy, Computer Science Colloquium, U of Minnesota, 19 April 1995.
68. Finding a good job as a programmer, informal seminar/discussion, IEEE student chapter, U Minnesota, Minneapolis, 15 October 1994.
69. When are supercomputers cheaper than workstations?, invited lecture, High Performance Computing Workshop, Cetraro, Italy, 27-29 June 1994.
70. Algorithm design for high-performance computers, CS Department Colloquium, Tufts University, 26 March 1994.
71. Tools for scientific computation: visualization and randomization, Computer Science department colloquium, U Minnesota, Minneapolis, October 18, 1993.
72. On visualizing the flow of information in a supercomputer, invited lecture, DIMACS Workshop on Models, Architectures, and Technologies for Parallel Computation, Rutgers University, September 20-22, 1993.
73. What is interesting about IBM's AS/400 line of computers?, Computer Science department colloquium, U Minnesota at Duluth, May 12, 1993.
74. Does your computation belong on a vector supercomputer or on a workstation?, DEC Cambridge Research Laboratory, March 15, 1993.
75. Does your computation belong on a vector supercomputer or on a workstation?, Computer Systems Engineering Seminar, UMass-Amherst, February 25, 1993.
76. Does your computation belong on a vector supercomputer or on a CM-5?, Thinking Machines Corporation, January 19, 1993.
77. Rectilinear Steiner tree minimization on a workstation, DIMACS Workshop on Computational Support for Discrete Mathematics, Rutgers, March 12-14, 1992.
78. Computers in the office of the future, Minn-Arrow Chapter of Professional Secretaries International, Superior WI, January 15, 1991.
79. Probabilistic algorithms for VLSI routing, invited lecture (delivered by P. Raghavan), 1988 TIMS/ORSA Meeting, Washington, D.C., April 27, 1988.
80. Military control of academic research, invited lecture at ``Our unexamined debts: government, corporations, and the university,'' a symposium at Johns Hopkins University, February 27, 1988.
81. A uniform representation for partially embedded graphs, colloquium at Johns Hopkins Computer Science Department, February 26, 1988.
82. A uniform representation for partially embedded graphs, invited lecture at the IMA Workshop on Applications of Combinatorics and Graph Theory to Computer Science Including VLSI Design, Minneapolis, December 16, 1987.
83. The effects of SDI on universities, invited lecture at ``Star Wars and national security: a conference on the Strategic Defense Initiative,'' UC Berkeley, October 9, 1986.

1. William Zhu, Concepts and techniques in software watermarking and obfuscation, University of Auckland, August 2007. Research fellow: October 2006 - September 2007.
2. Jasvir Nagra, Threading software watermarks, University of Auckland, February 2007. Research Fellow at the University of Auckland, from April 2006 through December 2006.
3. Andrew Michael Colarik, A secure patch management authority, University of Auckland, November 2003. Primary supervisor: Associate Professor Lech Janczewski. As at 2006, an independent information security consultant.
4. Belle Wei, Synthesis and optimization of VLSI prefix circuits, Ph.D. dissertation, Computer Science Division, UC Berkeley, May 1987. As at 2006, Dean of Engineering at San Jose State University, California (USA).
5. Prabhakar Raghavan, Randomized rounding and discrete ham-sandwich theorems: provably good algorithms for routing and packing problems, Ph.D. dissertation, Computer Science Division, UC Berkeley, May 1986. As at 2006, Head of Research at Yahoo, Consulting Professor of Computer Science at Stanford University, Editor in Chief of J. ACM.

1. Yu-Cheng Tu, (ME Second Class, July 2008: A Preliminary Security Analyais of New Zealand's igovt System).
2. Gilbert Notoatmodjo, (MSc First Class, Exploring the Weakest Link: A Study of Personal Password Security, submitted for assessment, July 2007; revised for internet publication, December 2007). As at March 2009, working in the IT Advisory Services group of KPMG Singapore.
3. Jinho Lee, (ME First Class, September 2006: Perceptions of HIPAA Security Requirements by US Dental Schools). As at August 2007, working for FirstData Utilities as a software engineer.
4. Lei Wang, (MSc, September 2006: A Constant Encoding Algorithm Which Tamper-proofs the CT-Watermark). 780 project student March-June 2005. As of March 2007, working for SecureMX.
5. Teng Teng, (MSc Second Class First Division, July 2006: Unauthorized Detection of CT Watermarks Based on Pattern Analysis Methods). 780 project student March-June 2005.
6. Han Zhang, (MSc Second Class Second Division, July 2006: Formal Security Modeling and Analysis in B2B e-commerce), co-supervised by Gerald Weber. ICT Academy project on Secure P2P Message Exchanging in a Test Harness, 14 February 2005, co-supervisor Gerald Weber, industry mentor Barry Dowdeswell. As at March 2007, working for Flipmind.
7. Mike Stay (MSc First Class, 2005: Truth and Light: Physical Algorithmic Randomness), co-supervised by Prof Cris Calude. As at 2006, PhD student in Physics at UC Riverside, California (USA).
8. Matt Barrett (BSc Hons, 2003; MSc First Class, 2005: Towards an Open Trusted Computing Framework). Co-author of Using NGSCB to Mitigate Existing Software Threats (preliminary version), in Certification and Security in Inter-Organizational E-Services, eds. Narelli and Talamo, IFIP Vol. 177, Springer, ISBN 0-387-25087-5, pp. 55-74, 2005. Author of "Using NGSCB to Solve Existing Software Vulnerabilities", project report, November 2003.
9. Benjamin Lai (MSc First Class, February 2004: Trust in Online Trading Systems).
10. Yong (Charles) He, (MSc, 2002: Tamperproofing a Software Watermark by Encoding Constants). Now working for the ACC.
11. Jihong Li, (MSc, Second Class Division 1, 2002: A Fifth Generation Messaging System).
12. Qiang Dong, (MSc, 2002: Workflow Simulation for International Trade). Now working for Vasco Data Security of Brisbane. Alternate email address.
13. John (Ching Yi) Tsai (MSc, 2000: A comparative study of two astronomical software packages), now working at Ulead Systems, Inc. (Taiwan)
14. Yale (Yuanhua) Yu (MSc, 2000: Measuring Data Cache and TLB Parameters under Linux), and co-author of a conference paper by the same title. Now working at Ericsson Telecommunication Australia on a project for Hutchinson. Alternate email address.
15. Petrus Mursanto (MSc, 1999: Automatic Detection of Vehicular Axle Distance at Tollgates), now working at the Computer Science Department of the University of Indonesia.
16. Douglas Low (MSc, 1998: Java Control Flow Obfuscation), primary supervisor: Christian Collberg. PhD dissertation: Network Processor Memory Hierarchy Designs for IP Packet Classification, Summer 2005, Computer Science Department of the University of Washington, advisor Jean-Loup Baer. Employment as at May 2006: Intel, Folsom CA, USA.
17. Leon Quiding (MSc, 1999: A Formal Model and General Theory for Comparator Networks), now developing software somewhere in New Jersey (USA).
18. Yi Sun, Delay optimization of carry lookahead adders using dynamic programming, Master's project, Computer Science Department, UMN-Duluth, May 1993.
19. Xun Zhao, An interface for transforming information from TimberWolf into RanTer, Master's project, Computer Science Department, UMN-Duluth, June 1992. Zhao's project report is published as UMD-CS TR 92-02.
20. Yanzhang Lu, Solving combinatorial optimization problems by simulated annealing, genetic algorithms, and neural networks, Master's thesis, Computer Science Department, UMN-Duluth, September 1991.
21. Renato Milanesi, Optimal look-ahead adders, Master's thesis, Computer Science Department, UMN-Duluth, July 1991.
22. Sree Rama Peyyety, A proposal for measurement study of Ethernet traffic, Master's project, Computer Science Department, UMN-Duluth, May 1991.
23. Clyde Rogers, Enhancements to Ziv-Lempel data compression, Master's thesis, Computer Science Department, UMN-Duluth, May 1989.
24. Simon Kahan, Problems in recognizing handprinted characters, Master's project, Computer Science Division, UC Berkeley, May 1985.
25. William Zurafleff, A personal computer network via CB radio links, Master's project, Computer Science Division, UC Berkeley, May 1985.
26. Michael Wolfe, Musical instrument pitch analyzer, Master's project, Computer Science Division, UC Berkeley, May 1983.
27. Andy Judkis, Net Funicello: a simple microcomputer network, Master's project, Computer Science Division, UC Berkeley, May 1982.
28. David J. Hathaway, A universal debugger for microcomputer software, Master's project, Computer Science Division, UC Berkeley, May 1982.
29. Yi-Hsien Do, Interface the Biomation 610 Transient Recorder to the PDP 11/10 Computer, Master's project, Computer Science Division, UC Berkeley, May 1982.

1. Dong Zhang, (BSc Hons dissertation, 2006, Form-Oriented Security Analysis of The WrecDirect Web Application). Primary supervisor Gerald Weber, industry mentor Barry Dowdeswell. As at March 2007, working for Deloitte Touche Tomatsu.
2. Glenn McCord, ICT Academy project on ITBC Systems and IT Phase 1, co-supervised with Ewan Tempero, February 2006.
3. Horace Haoqing Guo, ICT Academy project on Analysis of Development of AS2 in EDIS, February 2005. Co-supervisor: Gerald Weber. Industry mentor: Barry Dowdeswell.
4. Jun Ho Huh, ICT Academy project on EDIS Security and Non-Repudiation, February 2005. Co-supervisor: Gerald Weber. Industry mentor: Barry Dowdeswell.
5. Shelly Mutu-Grigg (BSc, 2003). Examining Fifth Generation Messaging Systems, project report, January 2003.
6. Guanglun Yu, summer project on Record and Playback for Java Software Watermarking, February 2001.
7. Hongying (Jenny) Lai, summer project on A comparative survey of Java obfuscators available on the internet, February 2001.
8. Michael (Duc) Ta (BTech Hons, 1998: Test-bed for Distributed Object Technologies using Java), now working for Zivo Internet Solutions (New Zealand). Co-supervisor: Radu Nicolescu.
9. Terry (Tiejun) Xiao, Memory accounting system, 1998.
10. Robert Plotkin, mrandom 3.0: An interface for pseudorandom number generators, Bachelor's thesis, Department of Electrical Engineering and Computer Science, Massachussetts Institute of Technology, May 1993.
11. Antony P-C Ng, undergraduate research associate at UC Berkeley, 1986-87. Co-author of three papers including one at the 1986 ACM Design Automation Conference.

Externally-Funded Research (partial listing):

• 2002-2007 (NERF) Securing Software for New Zealand, NZD $416k/year.
• 2000-2002 (NERF) Securing Software for New Zealand, NZD $125k/year.
• 2000 (Telecom NZ Ltd) Software Security Enhancements, $20k.
• 1981-94 (NSF) Algorithms for VLSI Design, averaging USD $60k/year.

Recent Professional Service

• University of Auckland Library Committee, February 2008 to January 2012, and August 2001 to July 2003.
• Programme committees in 2012: International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012), 26-29 August 2012, Istanbul; Australasian Information Security Conference (ACSW-AISC 2012), 30 January - 3 February 2012, Melbourne;
• Programme committees in 2011: International Conference on IT Convergence and Security (ICITCS 2011), 14-16 December 2011, Suwon; 8th VLDB Workshop on Secure Data Management (SDM 2011), 2 September 2011, Seattle; IEEE Intelligence and Security Informatics (ISI 2011) , 10-12 July 2011, Beijing; The IEEE 25th International Conference on Advanced Information Networking and Applications (AINA- 2011), 22-25 March 2011, Singapore; Australasian Information Security Conference (ACSW-AISC 2011), 17-20 January 2011, Perth;
• Programme committees in 2010: 2010 Mexican Meeting on Informatics Security (M2IS), Guadalajara City, 27-29 October 2010; 7th VLDB Workshop on Secure Data Management (SDM 2010), 17 September 2010, Singapore; 7th VLDB Workshop on Secure Data Management (SDM 2010), 17 September 2010, Singapore; 2010 Mexican Meeting on Informatics Security (M2IS 2010), 20-23 June 2010, Guadalaraja City, Mexico; Australasian Information Security Conference (ACSW-AISC 2010), 18-21 January 2010, Brisbane, Australia.
• Programme committees in 2009: 9th ACM DRM Workshop (co-located with ACM CCS 2009), 9 November 2009, Chicago; Second International Workshop on Remote Entrusting (ReTrust 2009) 30 September - 1 October 2009, Riva del Garda, Italy; 6th VLDB Workshop on Secure Data Management (SDM'09), 28 August 2009, Lyon, France; ACM Symposium on Information, Computer and Communications Security (ASIACCS'09) 10-12 March 2009, Sydney, Australia.
• Programme committees in 2008: 2008 International Symposium on Information Theory and its Applications (ISITA2008), 7-10 December 2008, Auckland, New Zealand; European Conference on Intelligence and Security Informatics (EuroISI 2008), 3-5 December 2008, Copenhagen, Denmark; Fifth VLDB Workshop on Secure Data Management, 25 August 2008, Auckland, NZ; Intelligence and Security Informatics (ISI 2008), 17-20 June 2008, Taipei, Taiwan; TRUST2008, 10-13 March 2008, Villach, Austria.
• Programme committees in 2007: Intelligence and Security Informatics 2007, 23-24 May 2007, New Brunswick, NJ USA.
• Programme committees in 2006: Mexican Conference on Informatics Security 2006, 14-17 Nov 2006, Oaxaca, Mexico; First ACM Workshop on Content Protection and Multimedia Security (MCPS 2006), 27 October 2006, Santa Barbara, CA, USA; Eleventh Australasian Conference on Information Security and Privacy, 3-5 July 2006, Melbourne, Australia; IEEE Intelligence and Security Informatics Conference, 23-24 May 2006, San Diego, California, USA.
• Programme committees in 2005 (partial list): ACM Conference on Electronic Commerce (EC'05), 5-8 June 2005, Vancouver Canada.
• Member of editorial board: Computing and Informatics, 1985 - 2009.