![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Chris Reade
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j10]Jasaswi Prasad Mohanty
, Chittaranjan A. Mandal, Chris Reade:
Distributed construction of minimum Connected Dominating Set in wireless sensor network using two-hop information. Comput. Networks 123: 137-152 (2017) - 2016
- [j9]Jasaswi Prasad Mohanty
, Chittaranjan A. Mandal, Chris Reade, Ariyam Das:
Construction of minimum connected dominating set in wireless sensor networks using pseudo dominating set. Ad Hoc Networks 42: 61-73 (2016) - 2013
- [c15]Ariyam Das, Chittaranjan A. Mandal, Chris Reade:
Determining the User Intent Behind Web Search Queries by Learning from Past User Interactions with Search Results. COMAD 2013: 135-138 - 2011
- [c14]Ariyam Das, Chittaranjan A. Mandal, Chris Reade, Manish Aasawat:
An improved greedy construction of minimum connected dominating sets in wireless networks. WCNC 2011: 790-795
2000 – 2009
- 2007
- [j8]Amit Kumar Mandal, Chittaranjan A. Mandal, Chris Reade:
A System for Automatic Evaluation of C Programs: Features and Interfaces. Int. J. Web Based Learn. Teach. Technol. 2(4): 24-39 (2007) - [c13]Chandan Karfa
, Dipankar Sarkar, Chittaranjan A. Mandal, Chris Reade:
Hand-in-hand verification of high-level synthesis. ACM Great Lakes Symposium on VLSI 2007: 429-434 - [c12]Chandan Karfa
, Chittaranjan A. Mandal, Dipankar Sarkar, Chris Reade:
Register Sharing Verification During Data-Path Synthesis. ICCTA 2007: 135-140 - [c11]Chittaranjan A. Mandal, Chris Reade:
Recipient Specific Electronic Cash - A Scheme for Recipient Specific Yet Anonymous and Tranferable Electronic Cash. WEBIST (3) 2007: 204-209 - 2006
- [c10]Chandan Karfa
, Chittaranjan A. Mandal, Dipankar Sarkar, S. R. Pentakota, Chris Reade:
A Formal Verification Method of Scheduling in High-level Synthesis. ISQED 2006: 71-78 - [c9]Chandan Karfa
, Chittaranjan A. Mandal, Dipankar Sarkar, S. R. Pentakota, Chris Reade:
Verification of Scheduling in High-level Synthesis. ISVLSI 2006: 141-146 - [c8]Amit Kumar Mandal, Chittaranjan A. Mandal, Chris Reade:
A System for Automatic Evaluation of Programs for Correctness and Performance. WEBIST (2) 2006: 196-203 - [c7]Amit Kumar Mandal, Chittaranjan A. Mandal, Chris Reade:
A System for Automatic Evaluation of Programs for Correctness and Performance. WEBIST (Selected Papers) 2006: 367-380 - [c6]Chittaranjan A. Mandal, Chris Reade:
Animating Algorithms over the Web. WEBIST (2) 2006: 403-407 - 2004
- [j7]Chris Reade:
"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. 14(1): 125-128 (2004) - 2002
- [j6]Chris Reade, Alan E. Middleditch, Abel João Padrão Gomes:
Least Stratifications and Cell-Structured Objects in Geometric Modelling. Int. J. Shape Model. 8(1): 59-77 (2002) - 2001
- [c5]Dan Russell, Dominic Steinitz, Chris Reade:
Haskell: Language for Business Systems. Scottish Functional Programming Workshop 2001: 1-12 - 2000
- [j5]Alan E. Middleditch, Chris Reade:
Improvements for the Djinn API to a Geometric Modelling Kernel. Int. J. Shape Model. 6(1): 79-104 (2000) - [j4]Alan E. Middleditch, Chris Reade, Abel João Padrão Gomes:
Point-Sets and Cell Structures Relevant to Computer Aided Design. Int. J. Shape Model. 6(2): 175-206 (2000) - [c4]Alan E. Middleditch, Chris Reade, Abel João Padrão Gomes:
A Representation Independent Geometric Modeling Kernel. GMP 2000: 79-89
1990 – 1999
- 1999
- [j3]Alan E. Middleditch, Chris Reade, Abel João Padrão Gomes:
Set-combinations of the mixed-dimension cellular objects of the Djinn API. Comput. Aided Des. 31(11): 683-694 (1999) - [c3]Abel João Padrão Gomes, Alan E. Middleditch, Chris Reade:
A mathematical model for boundary representations of n-dimensional geometric objects. Symposium on Solid Modeling and Applications 1999: 270-277 - 1998
- [c2]Abel João Padrão Gomes, Alan E. Middleditch, Chris Reade:
Issues and Solutions in Feature-Based Modelling: Re-Designing the Shape Kernel of CAD Systems. PROLAMAT 1998: 325-336 - 1997
- [c1]Alan E. Middleditch, Chris Reade:
A Kernel for Geometric Features. Symposium on Solid Modeling and Applications 1997: 131-140 - 1993
- [j2]Chris Reade:
Terminating Comprehensions. J. Funct. Program. 3(2): 247-250 (1993) - 1992
- [j1]Chris Reade:
Balanced Trees with Removals: An Exercise in Rewriting and Proof. Sci. Comput. Program. 18(2): 181-204 (1992)
1980 – 1989
- 1989
- [b1]Chris Reade:
Elements of functional programming. International computer science series, Addison-Wesley 1989, ISBN 978-0-201-12915-1, pp. I-XV, 1-600
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint