Chris Reade

According to our database1, Chris Reade authored at least 25 papers between 1989 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Distributed construction of minimum Connected Dominating Set in wireless sensor network using two-hop information.
Comput. Networks, 2017

2016
Construction of minimum connected dominating set in wireless sensor networks using pseudo dominating set.
Ad Hoc Networks, 2016

2013
Determining the User Intent Behind Web Search Queries by Learning from Past User Interactions with Search Results.
Proceedings of the 19th International Conference on Management of Data, 2013

2011
An improved greedy construction of minimum connected dominating sets in wireless networks.
Proceedings of the 2011 IEEE Wireless Communications and Networking Conference, 2011

2007
A System for Automatic Evaluation of C Programs: Features and Interfaces.
Int. J. Web Based Learn. Teach. Technol., 2007

Recipient Specific Electronic Cash - A Scheme for Recipient Specific Yet Anonymous and Tranferable Electronic Cash.
Proceedings of the WEBIST 2007, 2007

Register Sharing Verification During Data-Path Synthesis.
Proceedings of the 2007 International Conference on Computing: Theory and Applications (ICCTA 2007), 2007

Hand-in-hand verification of high-level synthesis.
Proceedings of the 17th ACM Great Lakes Symposium on VLSI 2007, 2007

2006
Animating Algorithms over the Web.
Proceedings of the WEBIST 2006, 2006

A System for Automatic Evaluation of Programs for Correctness and Performance.
Proceedings of the WEBIST 2006, 2006

Verification of Scheduling in High-level Synthesis.
Proceedings of the 2006 IEEE Computer Society Annual Symposium on VLSI (ISVLSI 2006), 2006

A Formal Verification Method of Scheduling in High-level Synthesis.
Proceedings of the 7th International Symposium on Quality of Electronic Design (ISQED 2006), 2006

2004
"Proof, Language and Interaction, Essays in Honour of Robin Milner" by Gordon Plotkin, Colin Sterling and Mads Tofte (eds.), Foundations of Computing Series, MIT Press 2000.
J. Funct. Program., 2004

2002
Least Stratifications and Cell-Structured Objects in Geometric Modelling.
Int. J. Shape Model., 2002

2001
Haskell: Language for Business Systems.
Proceedings of the Selected papers from the 3rd Scottish Functional Programming Workshop (SFP01), 2001

2000
Point-Sets and Cell Structures Relevant to Computer Aided Design.
Int. J. Shape Model., 2000

Improvements for the Djinn API to a Geometric Modelling Kernel.
Int. J. Shape Model., 2000

A Representation Independent Geometric Modeling Kernel.
Proceedings of the Geometric Modeling and Processing 2000, 2000

1999
Set-combinations of the mixed-dimension cellular objects of the Djinn API.
Comput. Aided Des., 1999

A mathematical model for boundary representations of n-dimensional geometric objects.
Proceedings of the Fifth ACM Symposium on Solid Modeling and Applications, 1999

1998
Issues and Solutions in Feature-Based Modelling: Re-Designing the Shape Kernel of CAD Systems.
Proceedings of the Globalization of Manufacturing in the Digital Communications Era of the 21<sup>st</sup> Century: Innovation, 1998

1997
A Kernel for Geometric Features.
Proceedings of the Fourth Symposium on Solid Modeling and Applications, 1997

1993
Terminating Comprehensions.
J. Funct. Program., 1993

1992
Balanced Trees with Removals: An Exercise in Rewriting and Proof.
Sci. Comput. Program., 1992

1989
Elements of functional programming.
International computer science series, Addison-Wesley, ISBN: 978-0-201-12915-1, 1989


  Loading...