default search action
John G. Cleary
Person information
- affiliation: University of Waikato, Hamilton, New Zealand
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j28]John G. Cleary, Ross Braithwaite, Kurt Gaastra, Brian S. Hilbush, Stuart Inglis, Sean A. Irvine, Alan Jackson, Richard Littin, Sahar Nohzadeh-Malakshah, Mehul Rathod, David Ware, Len Trigg, Francisco M. de la Vega:
Joint Variant and De Novo Mutation Identification on Pedigrees from High-Throughput Sequencing Data. J. Comput. Biol. 21(6): 405-419 (2014) - [j27]Mark Utting
, Min-Hsien Weng
The JStar language philosophy. Parallel Comput. 40(2): 35-50 (2014) - 2013
- [c30]Mark Utting
The JStar language philosophy. PMAM 2013: 31-41 - 2010
- [i3]Lunjin Lu, John G. Cleary:
Simplifying Negative Goals Using Typed Existence Properties. CoRR abs/1009.2178 (2010)
2000 – 2009
- 2005
- [j26]Raf M. Podowski
Suregene, a Scalable System for Automated Term Disambiguation of Gene and Protein Names. J. Bioinform. Comput. Biol. 3(3): 743-770 (2005) - 2004
- [c29]Raf M. Podowski, John G. Cleary, Nicholas T. Goncharoff
AZuRE, a Scalable System for Automated Term Disambiguation of Gene and Protein Names. CSB 2004: 415-424 - 2002
- [j25]John G. Cleary, Ian Graham, Tony McGregor, Murray Pearson, Ilze Ziedins
High precision traffic measurement. IEEE Commun. Mag. 40(3): 167-173 (2002) - [c28]Roger Clayton, John G. Cleary, Bernhard Pfahringer, Mark Utting
Tabling Structures for Bottom-Up Logic Programming. LOPSTR 2002: 50-51 - [c27]Xiao Zhonge, Rob Simmonds, Brian W. Unger, John G. Cleary:
Parallel and distributed simulation: fast cell level ATM network simulation. WSC 2002: 712-719 - 2000
- [j24]Brian W. Unger, Zhonge Xiao, John G. Cleary, Jya-Jang Tsai, Carey L. Williamson:
Parallel shared-memory simulator performance for large ATM networks. ACM Trans. Model. Comput. Simul. 10(4): 358-391 (2000)
1990 – 1999
- 1999
- [c26]John G. Cleary, W. J. Teahan:
An Open Interface for Probabilistic Models of Text. Data Compression Conference 1999: 522 - [c25]Lunjin Lu, John G. Cleary:
A Regular Type Analysis of Logic Programs. ICLP 1999: 613 - [c24]Xiao Zhonge, Brian W. Unger, Rob Simmonds, John G. Cleary:
Scheduling Critical Channels in Conservative Parallel Discrete Event Simulation. Workshop on Parallel and Distributed Simulation 1999: 20-28 - [c23]Lunjin Lu, John G. Cleary:
An Operational Semantics of Starlog. PPDP 1999: 294-310 - 1998
- [c22]W. J. Teahan, John G. Cleary:
Tag Based Models of English Text. Data Compression Conference 1998: 43-52 - [c21]W. J. Teahan, Stuart Inglis, John G. Cleary, Geoffrey Holmes:
Correcting English Text Using PPM Models. Data Compression Conference 1998: 289-298 - [c20]John G. Cleary, Lunjin Lu:
Constructive Negation Using Typed Existence Properties. PLILP/ALP 1998: 411-426 - [i2]Lunjin Lu, John G. Cleary:
On Dart-Zobel Algorithm for Testing Regular Type Inclusion. CoRR cs.LO/9810001 (1998) - [i1]Lunjin Lu, John G. Cleary:
An Emptiness Algorithm for Regular Types with Set Operators. CoRR cs.LO/9811015 (1998) - 1997
- [j23]John G. Cleary, W. J. Teahan:
Unbounded Length Contexts for PPM. Comput. J. 40(2/3): 67-75 (1997) - [j22]John G. Cleary:
Constructive Negation of Arithmetic Constraints Using Dataflow Graphs. Constraints An Int. J. 2(2): 131-162 (1997) - [j21]Colin Boyd, John G. Cleary, Sean A. Irvine, Ingrid Rinsma-Melchert, Ian H. Witten
Integrating error detection into arithmetic coding. IEEE Trans. Commun. 45(1): 1-3 (1997) - [c19]W. J. Teahan, John G. Cleary:
Models of English Text. Data Compression Conference 1997: 12-21 - [c18]Murray Pearson, Richard Littin, J. A. David McWha, John G. Cleary:
Applying Time Warp to CPU design. HiPC 1997: 290-295 - [c17]Steve Franks, Fabian Gomes, Brian W. Unger, John G. Cleary:
State Saving for Interactive Optimistic Simulation. Workshop on Parallel and Distributed Simulation 1997: 72-79 - [c16]John G. Cleary, J. A. David McWha, Murray Pearson:
Timestamp Representations for Virtual Sequences. Workshop on Parallel and Distributed Simulation 1997: 98-105 - [c15]John G. Cleary, Jya-Jang Tsai:
Performance of a Conservative Simulator of ATM Networks. Workshop on Parallel and Distributed Simulation 1997: 142-145 - [c14]Fabian Gomes, Brian W. Unger, John G. Cleary, Steve Franks:
Multiplexed State Saving for Bounded Rollback. WSC 1997: 460-467 - 1996
- [c13]W. J. Teahan, John G. Cleary:
The Entropy of English Using PPM-based Models. Data Compression Conference 1996: 53-62 - [c12]John G. Cleary, Geoffrey Holmes, Sally Jo Cunningham, Ian H. Witten:
MetaData for Database Mining. MD 1996 - [c11]John G. Cleary, Jya-Jang Tsai:
Conservative Parallel Simulation of ATM Networks. Workshop on Parallel and Distributed Simulation 1996: 30-38 - [c10]Fabian Gomes, Brian W. Unger, John G. Cleary:
Language Based State Saving Extensions for Optimistic Parallel Simulation. WSC 1996: 794-800 - 1995
- [j20]John G. Cleary, Sean A. Irvine, Ingrid Rinsma-Melchert:
On the insecurity of arithmetic coding. Comput. Secur. 14(2): 167-180 (1995) - [c9]John G. Cleary, W. J. Teahan, Ian H. Witten:
Unbounded Length Contexts for PPM. Data Compression Conference 1995: 52-61 - [c8]John G. Cleary, Murray Pearson, Husam Kinawi:
The architecture of an optimistic CPU: the WarpEngine. HICSS (1) 1995: 163-172 - [c7]John G. Cleary, Leonard E. Trigg:
K*: An Instance-based Learner Using and Entropic Distance Measure. ICML 1995: 108-114 - [c6]Zhonge Xiao, Fabian Gomes, Brian W. Unger, John G. Cleary:
A fast asynchronous GVT algorithm for shared memory multiprocessor architectures. PADS 1995: 203-208 - [c5]Fabian Gomes, John G. Cleary, Alan Covington, Steve Franks, Brian W. Unger, Xiao Zhonge:
SimKit: A High Performance Logical Process Simulation Class Library in C++. WSC 1995: 706-713 - [c4]Darrin West, John G. Cleary, Jim Hofmann, Larry Mellon, Jim Ramsey:
Infrastructure for Rapid Execution of Strike-Planning Systems. WSC 1995: 1207-1214 - 1994
- [c3]John G. Cleary, Fabian Gomes, Brian W. Unger, Zhonge Xiao, Raimar Thudt:
Cost of state saving & rollback. PADS 1994: 94-101 - 1993
- [j19]Brian W. Unger, John G. Cleary:
Commentary - Practical Parallel Discrete Event Simulation. INFORMS J. Comput. 5(3): 242-244 (1993) - [j18]John J. Darragh, John G. Cleary, Ian H. Witten:
Bonsai: a Compact Representation of Trees. Softw. Pract. Exp. 23(3): 277-291 (1993) - [c2]Brian W. Unger, John G. Cleary, Alan Covington, Darrin West:
An external state management system for optimistic parallel simulation. WSC 1993: 750-755 - 1992
- [j17]Xining Li, John G. Cleary, Brian W. Unger:
Virtual time and virtual space. Int. J. Parallel Program. 21(2): 123-150 (1992) - [c1]Ian Olthof, John G. Cleary:
AND-Parallel Prolog on a Transputer-Based System. IJCSLP Workshop on Concurrent and Parallel Implementations 1992
1980 – 1989
- 1989
- [j16]Timothy C. Bell
Modeling for Text Compression. ACM Comput. Surv. 21(4): 557-591 (1989) - 1988
- [j15]Ian H. Witten, John G. Cleary:
On the privacy afforded by adaptive text compression. Comput. Secur. 7(4): 397-408 (1988) - [j14]John G. Cleary, Geoff Wyvill:
Analysis of an algorithm for fast ray tracing using uniform space subdivision. Vis. Comput. 4(2): 65-83 (1988) - 1987
- [j13]Ian H. Witten
Arithmetic Coding for Data Compression. Commun. ACM 30(6): 520-540 (1987) - [j12]John G. Cleary:
Acquisition of Uncertain Rules in a Probabilistic Logic. Int. J. Man Mach. Stud. 27(2): 145-154 (1987) - 1986
- [j11]John G. Cleary, Brian Wyvill, Graham M. Birtwistle, Reddy Vatti:
Multiprocessor Ray Tracing. Comput. Graph. Forum 5(1): 3-12 (1986) - [j10]Alan D. Dewar, John G. Cleary:
Graphical Display of Complex Information within a Prolog Debugger. Int. J. Man Mach. Stud. 25(5): 503-521 (1986) - 1984
- [j9]Ian H. Witten, John G. Cleary, Saul Greenberg:
On Frequency-Based Menu-Splitting Algorithms. Int. J. Man Mach. Stud. 21(2): 135-148 (1984) - [j8]John G. Cleary:
Compact Hash Tables Using Bidirectional Linear Probing. IEEE Trans. Computers 33(9): 828-834 (1984) - [j7]John G. Cleary, Ian H. Witten:
Data Compression Using Adaptive Coding and Partial String Matching. IEEE Trans. Commun. 32(4): 396-402 (1984) - [j6]John G. Cleary, Ian H. Witten:
A comparison of enumerative and adaptive codes. IEEE Trans. Inf. Theory 30(2): 306-315 (1984) - 1983
- [j5]Ian H. Witten, John G. Cleary:
An introduction to the architecture of the Intel iAPX 432. Softw. Microsystems 2(2): 29-34 (1983) - [j4]Ian H. Witten, Graham M. Birtwistle, John G. Cleary, David R. Hill, Danny Levinson, Greg Lomow, Radford M. Neal, Murray Peterson, Brian W. Unger, Brian Wyvill:
Jade: A Distributed Software Prototyping Environment. ACM SIGOPS Oper. Syst. Rev. 17(3): 10-23 (1983)
1970 – 1979
- 1979
- [j3]John G. Cleary:
Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space. ACM Trans. Math. Softw. 5(2): 183-192 (1979) - 1971
- [j2]Elliott I. Organick, John G. Cleary:
A data structure model of the B6700 computer system. ACM SIGPLAN Notices 6(2): 83-145 (1971)
1960 – 1969
- 1966
- [j1]John G. Cleary:
A Fortran technique for simplifying input to report generators. Commun. ACM 9(6): 441-442 (1966)
Coauthor Index
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-05-02 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: