John Field - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged completeness

Sound and complete computational interpretation of symbolic hashes in the standard modelFlavio D. Garcia, Peter van Rossum. TCS, 394(1-2):112-133, 2008. [doi]

Complete Distances of All Negacyclic Codes of Length 2:::s::: Over BBZ::2:::a:::::H. Q. Dinh. TIT, 53(1):147-161, 2007. [doi]

S4 is Topologically Complete for (0, 1): a Short ProofGrigori Mints. igpl, 14(1):63-71, 2006. [doi]

On Step-by-Step Complete Decoding Triple-Error-Correcting Binary BCH CodesShyue-Win Wei. ieicet, 89-A(11):3360-3362, 2006. [doi]

Virtual reference training: The complete guide to providing anytime anywhere answersDale A. Stirling. jasis, 56(11):1238-1239, 2005. [doi]

Shannon Information in Complete GenomesChang-Heng Chang, Li-Ching Hsieh, Ta-Yuan Chen, Hong-Da Chen, Liaofu Luo, Hoong-Chien Lee. jbcb, 3(3):587-608, 2005. [doi]

Linear lambda calculus and PTIME-completenessHarry G. Mairson. JFP, 14(6):623-633, 2004. [doi]

Learning SIMUL8: The Complete Guide (and SIMUL8 Version 6)Jaret Hauge, Kerrie Paige. jasss, 6(3), 2003. [doi]

Three-Query PCPs with Perfect Completeness over non-Boolean DomainsLars Engebretsen, Jonas Holmerin. cocoon 2003: 284-299 [doi]

Obtaining complete 2.5D view representation of polyhedra using concept of seedling single-view areaMonika Kowalczyk, Wojciech S. Mokrzycki. cviu, 91(3):280-301, 2003. [doi]

The maximum edge biclique problem is NP-completeRené Peeters. DAM, 131(3):651-654, 2003. [doi]

Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete TreesAlan A. Bertossi, Maria Cristina Pinotti. jpdc, 62(8):1314-1333, 2002. [doi]

Optimal Dynamic Embeddings of Complete Binary Trees into HypercubesVolker Heun, Ernst W. Mayr. jpdc, 61(8):1110-1125, 2001. [doi]

An ::::omega::::-Complete Equational Specification of InterleavingWan Fokkink, Bas Luttik. icalp 2000: 729-743 [doi]

An Inference Method for the Complete Inverse of Relative Subsumptionngc, 17(1), 1999.

There is no complete axiom system for shuffle expressionsAndrzej Szepietowski. ita, 33(3):271-278, 1999.

Toward a Complete Transformational Toolkit for CompilersJan A. Bergstra, T. B. Dinesh, John Field, Jan Heering. TOPLAS, 19(5):639-684, 1997. [doi]

A Sound and Complete CG Proof Procedure Combining Projections with Analytic TableauxGwen Kerdiles, Eric Salvat. iccS 1997: 371-385

A More Complete Model of Relations and Their ImplementationConrad Bock, James Odell. joop, 10(3):38, 1997.

A Complete Transformational Toolkit for CompilersJan A. Bergstra, T. B. Dinesh, John Field, Jan Heering. ESOP 1996: 92-107

A Complete Axiomatization for Prefix Iteration in Branching BisimulationWan Fokkink. FUIN, 26(2):103-113, 1996.

On the Completeness of the Euations for the Kleene Star in BisimulationWan Fokkink. amast 1996: 180-194

Complete Families of Linear Invariants for Some Stochastic Models of Sequence Evolution, with and without Molecular Clock AssumptionMichael D. Hendy, David Penny. jcb, 3(1):19-32, 1996.

Optimal Embedding of Large Complete Binary Trees into HypercubesChui-Cheng Chen, Rong-Jaye Chen. jise, 12(2):307-314, 1996. [doi]

A Complete Equational Axiomatization for Prefix IterationWan Fokkink. ipl, 52(6):333-337, 1994.

SwaN-NMR: A Complete and Expansible NMR Software for the MacintoshGiuseppe Balacco. jcisd, 34(6):1235-1241, 1994. [doi]

Simple Characterizations of P(#P) and Complete ProblemsSeinosuke Toda. jcss, 49(1):1-17, 1994.

The Fault-Tolerant Extension Problem for Complete Multipartite NetworksAbdel Aziz Farrag, Robert Dawson. tpds, 5(2):205-210, 1994. [doi]

A Complete Axiom System for CCS with a Stability OperatorSarah Liebert. imperial 1993: 226-234

Fault-Tolerant Embedding of Complete Binary Trees in HypercubesMee Yee Chan, Shiang-Jen Lee. tpds, 4(3):277-288, 1993. [doi]

Polynomial Representations of Complete Sets of Frequency Hyperrectangles with Prime Power DimensionsStephan J. Suchower. JCT, 62(1):46-65, 1993.

Complete Sets of Pairwise Orthogonal Latin Squares and the Corresponding Projective PlanesP. J. Owens. JCT, 59(2):240-252, 1992.

Weak Completeness of Type Assignment in lambda-Calculus Models: A Generalization of Hindley s ResultTCS, 87(1):203-208, 1991.

Problems Complete for +LCarsten Damm. imycs 1990: 130-137

Problems Complete for /oplus LCarsten Damm. ipl, 36(5):247-250, 1990.

Deciding ML Typability is Complete for Deterministic Exponential TimeHarry G. Mairson. POPL 1990: 382-401

The Problem of Determining the Size of a Complete Set of ReductionsLarry Wos. JAR, 5(2):235-237, 1989.

The Problem of Guaranteeing the Existence of a Complete Set of ReductionsLarry Wos. JAR, 5(3):399-401, 1989.

Fault-Tolerant Distributed Algorithm for Election in Complete NetworksHosame Abu-Amara. TC, 37(4):449-453, 1988.

Software Configuration - An NP-Complete ProblemJerry Calabough. DB, 19(2):29-34, 1988. [doi]

Distributed Election in Complete NetworksMee Yee Chan, Francis Y. L. Chin. dc, 3(1):19-22, 1988.

THOMAS - A Complete Single Chip RSA DeviceGordon Rankine. crypto 1987: 480-487 [doi]

A Completeness Theorem for Recursively Defined TypesMario Coppo. icalp 1985: 120-129

Completeness of Type Assignment in Continuous Lambda ModelsMario Coppo. TCS, 29:309-324, 1984.

Complete Solution of Boolean EquationsMoiez A. Tapia, Jerry H. Tucker. TC, 29(7):662-665, 1980.

The edge-coloring of complete hypergraphs IZsolt Baranyai. JCT, 26(3):276-294, 1979. [doi]

One More Polynomial Complete Consecutive Retrieval ProblemWitold Lipski Jr.. ipl, 6(3):91-93, 1977.

Hierarchies of Complete ProblemsZvi Galil. ACTA, 6:77-88, 1976.

Complete Sets and the Polynomial-Time HierarchyCelia Wrathall. TCS, 3(1):23-33, 1976.

a Combinatorial Problem which is Complete in Polynomial SpaceShimon Even, Robert Endre Tarjan. stoc 1975: 66-71

runs on WebDSL