Clark D. Thomborson

Orcid: 0000-0002-4147-7898

Affiliations:
  • University of Auckland, Department of Computer Science


According to our database1, Clark D. Thomborson authored at least 82 papers between 1977 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Stegogames.
Proceedings of the Information Security and Privacy - 22nd Australasian Conference, 2017

2016
An experiment on the impact of transparency on the effectiveness of requirements documents.
Empir. Softw. Eng., 2016

Privacy patterns.
Proceedings of the 14th Annual Conference on Privacy, Security and Trust, 2016

2015
Benchmarking Obfuscators of Functionality.
CoRR, 2015

Pinpointing and Hiding Surprising Fragments in an Obfuscated Program.
Proceedings of the 5th Program Protection and Reverse Engineering Workshop, 2015

2014
Evaluating Presentation of Requirements Documents: Results of an Experiment.
Proceedings of the Requirements Engineering, 2014

2013
The dhammic framework for understanding the cause of system project failures from Buddhist insights.
Proceedings of the IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing, 2013

2012
A novel watermarking method for software protection in the cloud.
Softw. Pract. Exp., 2012

Multimedia Applications and Security in MapReduce: Opportunities and Challenges.
Concurr. Comput. Pract. Exp., 2012

A cloud-based watermarking method for health data security.
Proceedings of the 2012 International Conference on High Performance Computing & Simulation, 2012

The Art and Science of Obfuscation.
Proceedings of the Information Systems, Technology and Management, 2012

2011
Illusions and Perceptions of Transparency in Software Engineering.
Proceedings of the 18th Asia Pacific Software Engineering Conference, 2011

2010
A Framework for System Security.
Proceedings of the Handbook of Information and Communication Security, 2010

Axiomatic and Behavioural Trust.
Proceedings of the Trust and Trustworthy Computing, Third International Conference, 2010

2009
A semi-dynamic multiple watermarking schemefor java applications.
Proceedings of the 9th ACM Workshop on Digital Rights Management, 2009

Preliminary Security Specification for New Zealand's igovt System.
Proceedings of the Seventh Australasian Information Security Conference, 2009

Foundation for Systems Security.
Proceedings of the Seventh Australasian Information Security Conference, 2009

Passwords and Perceptions.
Proceedings of the Seventh Australasian Information Security Conference, 2009

2008
A Model for New Zealand's Identity Verification Service.
Proceedings of the Trusted Computing, 2008

2007
Dynamic graph-based software fingerprinting.
ACM Trans. Program. Lang. Syst., 2007

Specifying Imperative Data Obfuscations.
Proceedings of the Information Security, 10th International Conference, 2007

Slicing obfuscations: design, correctness, and evaluation.
Proceedings of the Seventh ACM Workshop on Digital Rights Management, 2007

Metrics-based Evaluation of Slicing Obfuscations.
Proceedings of the Third International Symposium on Information Assurance and Security, 2007

Slicing Aided Design of Obfuscating Transforms.
Proceedings of the 6th Annual IEEE/ACIS International Conference on Computer and Information Science (ICIS 2007), 2007

2006
Applications of Homomorphic Functions to Software Obfuscation.
Proceedings of the Intelligence and Security Informatics, International Workshop, 2006

Extraction in software watermarking.
Proceedings of the 8th workshop on Multimedia & Security, 2006

A Survey of Control-Flow Obfuscations.
Proceedings of the Information Systems Security, Second International Conference, 2006

Obfuscate arrays by homomorphic functions.
Proceedings of the 2006 IEEE International Conference on Granular Computing, 2006

Frameworks Built on the Trusted Platform Module.
Proceedings of the 30th Annual International Computer Software and Applications Conference, 2006

Manufacturing opaque predicates in distributed systems for code obfuscation.
Proceedings of the Computer Science 2006, 2006

2005
Tamper-Resistant Software System Based on a Finite State Machine.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Securing Mobile Agents Control Flow Using Opaque Predicates.
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2005

A Survey of Software Watermarking.
Proceedings of the Intelligence and Security Informatics, 2005

On the QP Algorithm in Software Watermarking.
Proceedings of the Intelligence and Security Informatics, 2005

On the Use of Opaque Predicates in Mobile Agent Code Obfuscation.
Proceedings of the Intelligence and Security Informatics, 2005

Algorithms to Watermark Software Through Register Allocation.
Proceedings of the Digital Rights Management: Technologies, 2005

2004
Threading Software Watermarks.
Proceedings of the Information Hiding, 6th International Workshop, 2004

Update/Patch Management Systems: A Protocol Taxonomy with Security Implications.
Proceedings of the Information Security Management, Education and Privacy, 2004

Tamper-proo ng Software Watermarks.
Proceedings of the ACSW Frontiers 2004, 2004 ACSW Workshops, 2004

A Framework for Obfuscated Interpretation.
Proceedings of the ACSW Frontiers 2004, 2004 ACSW Workshops, 2004

2003
Graph-Based Approaches to Software Watermarking.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2003

Folklore confirmed: reducible flow graphs are exponentially larger.
Proceedings of the Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2003

2002
Watermarking, Tamper-Proofing, and Obfuscation-Tools for Software Protection.
IEEE Trans. Software Eng., 2002

A Functional Taxonomy for Software Watermarking.
Proceedings of the Computer Science 2002, 2002

1999
Software Watermarking: Models and Dynamic Embeddings.
Proceedings of the POPL '99, 1999

1998
The Economics of Large-Memory Computations.
Inf. Process. Lett., 1998

Manufacturing Cheap, Resilient, and Stealthy Opaque Constructs.
Proceedings of the POPL '98, 1998

Breaking Abstractions and Unstructuring Data Structures.
Proceedings of the 1998 International Conference on Computer Languages, 1998

Data cache parameter measurements.
Proceedings of the International Conference on Computer Design: VLSI in Computers and Processors, 1998

1994
A Probaby Fast, Provably Optimal Algorithm for Rectilinear Steiner Trees.
Random Struct. Algorithms, 1994

1993
Why are fewer females obtaining bachelor's degrees in computer science?
SIGACT News, 1993

Does Your Workstation Computation Belong on a Vector Supercomputer?
Commun. ACM, 1993

Optimizing carry lookahead adders for semicustom CMOS.
Proceedings of the Third Great Lakes Symposium on Design Automation of High Performance VLSI Systems, 1993

1992
Delay Optimization of Carry-Skip Adders and Block Carry-Lookahead Adders Using Multidimensional Dynamic Programming.
IEEE Trans. Computers, 1992

The V.42bis standard for data-compressing modems.
IEEE Micro, 1992

Rectilinear Steiner Tree Minimization on a Workstation.
Proceedings of the Computational Support for Discrete Mathematics, 1992

1991
Systolic implementations of a move-to-front text compressor.
SIGARCH Comput. Archit. News, 1991

An O(n log n) Plane-Sweep Algorithm for L_1 and L_\infty Delaunay Triangulations.
Algorithmica, 1991

Multiterminal Global Routing: A Deterministic Approximation Scheme.
Algorithmica, 1991

Delay optimization of carry-skip adders and block carry-lookahead adders.
Proceedings of the 10th IEEE Symposium on Computer Arithmetic, 1991

1990
Area-Time Optimal Adder Design.
IEEE Trans. Computers, 1990

Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract)
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989
Enhancements to Ziv-Lempel data compression.
Proceedings of the 13th Annual International Computer Software and Applications Conference, 1989

1987
Randomized rounding: a technique for provably good algorithms and algorithmic proofs.
Comb., 1987

Global Wire Routing in Two-Dimensional Arrays.
Algorithmica, 1987

A Minimum-Area Circuit for l-Selection.
Algorithmica, 1987

Computing a Rectilinear Steiner Minimal Tree in n<sup>O(sqrt(n))</sup> Time.
Proceedings of the Parallel Algorithms and Architectures, 1987

1986
Military Direction of Academic CS Research (Viewpoint).
Commun. ACM, 1986

A language for describing rectilinear Steiner tree configurations.
Proceedings of the 23rd ACM/IEEE Design Automation Conference. Las Vegas, 1986

1985
VLSI Design With Multiple Active Layers.
Inf. Process. Lett., 1985

Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard Transformations.
Inf. Process. Lett., 1985

Provably Good Routing in Graphs: Regular Arrays
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1984
An Efficient Implementation of Search Trees on (<i>lg N</i> + 1) Processors.
IEEE Trans. Computers, 1984

1983
The VLSI Complexity of Sorting.
IEEE Trans. Computers, 1983

Fourier Transforms in VLSI.
IEEE Trans. Computers, 1983

On the Energy-Time-Area Cost of a Memory Access.
Proceedings of the WG '83, 1983

Global Wire Routing in Two-Dimensional Arrays (Extended Abstract)
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1980
A Complexity Theory for VLSI.
PhD thesis, 1980

1979
Area-Time Complexity for VLSI
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

1978
Generalized Connection Networks for Parallel Processor Intercommunication.
IEEE Trans. Computers, 1978

On the Average Number of Maxima in a Set of Vectors and Applications.
J. ACM, 1978

1977
Sorting on a Mesh-Connected Parallel Computer.
Commun. ACM, 1977


  Loading...