F. Warren Burton - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 53 from 53

2006

Smarter garbage collection with simplifiersMelissa E. O Neill, F. Warren Burton. ACMmsp 2006: 19-30 [doi]

2000

Memory requirements for parallel programsF. Warren Burton, David J. Simpson. pc, 26(13-14):1739-1763, 2000.

1999

Space Efficient Execution of Deterministic Parallel ProgramsDavid J. Simpson, F. Warren Burton. TSE, 25(6):870-882, 1999. [doi]

1997

A New Method for Functional ArraysMelissa E. O Neill, F. Warren Burton. JFP, 7(5):487-513, 1997.

1996

Guaranteeing Good Memory Bound for Parallel ProgramsF. Warren Burton. TSE, 22(10):762-773, 1996. [doi]

1994

Worst Case Scheduling for Parallel Functional ProgramsF. Warren Burton, Victor J. Rayward-Smith. JFP, 4(1):65-75, 1994.

A Definite and Unfoldable, Partially Deterministic LanguageW. Ken Jackson, F. Warren Burton. cj, 37(8):711-714, 1994.

1993

Pattern Matching with Abstract Data TypesF. Warren Burton, Robert D. Cameron. JFP, 3(2):171-190, 1993.

Improving IntervalsW. Ken Jackson, F. Warren Burton. JFP, 3(2):153-169, 1993.

1992

Distributed Random Number GenerationF. Warren Burton, Rex L. Page. JFP, 2(2):203-212, 1992.

1991

Reply to Subtypes and Quantification F. Warren Burton. TOPLAS, 13(4):633, 1991.

Encapsulating Non-Determinacy in an Abstract Data Type with Determinate SemanticsF. Warren Burton. JFP, 1(1):3-20, 1991.

1990

Type Extension Through PolymorphismF. Warren Burton. TOPLAS, 12(1):135-138, 1990. [doi]

Implementation of Overlapping B-Trees for Time and Space Efficient Representation of Collections of Similar FilesF. Warren Burton, John G. Kollias, D. G. Matsakis, V. G. Kollias. cj, 33(3):279-280, 1990.

Applications of UET Scheduling Theory to the Implementation of Declarative LanguagesF. Warren Burton, Geoff P. McKeown, Victor J. Rayward-Smith. cj, 33(4):330-336, 1990.

1989

Indeterminate Behavior with Determinate Semantics in Parallel ProgramsF. Warren Burton. fpca 1989: 340-346 [doi]

Functional Programming with QuadtreesF. Warren Burton, John G. Kollias. IEEE Software, 6(1):90-97, 1989.

A Note on Higher-Order Functions Versus Logical VariablesF. Warren Burton. ipl, 31(2):91-95, 1989.

1988

Reduction of Storage Requirements by Sharing Common Information in an Office Information SystemF. Warren Burton, John G. Kollias. wi, 30(10):443-448, 1988.

On Process Assignment in Parallel ComputingF. Warren Burton, Geoff P. McKeown, Victor J. Rayward-Smith. ipl, 29(1):31-34, 1988.

Nondeterminism with Referential Transparency in Functional Programming LanguagesF. Warren Burton. cj, 31(3):243-247, 1988.

Storage Management in Virtual Tree MachinesF. Warren Burton. TC, 37(3):321-328, 1988.

Alpha-beta search on virtual tree machinesMatthew M. Huntbach, F. Warren Burton. isci, 44(1):3-17, 1988. [doi]

The general problem solving algorithm and its implementationVictor J. Rayward-Smith, Geoff P. McKeown, F. Warren Burton. ngc, 6(1):41-66, 1988. [doi]

1987

A General PASCAL Program for Map Overlay of Quadtrees and Related ProblemsF. Warren Burton, V. J. Kollias, John G. Kollias. cj, 30(4):355-361, 1987.

Functional Programming for Concurrent and Distributed ComputingF. Warren Burton. cj, 30(5):437-450, 1987.

A Space-Efficient Optimization of Call-by-NeedF. Warren Burton, Dieter Maurer, Hans-Georg Oberhauser, Reinhard Wilhelm. TSE, 13(6):636-642, 1987.

Batched Interpolation SearchYannis Manolopoulos, John G. Kollias, F. Warren Burton. cj, 30(6):565-568, 1987.

1986

Controlling reduction partial order in functional parallel programsF. Warren Burton. gr 1987: 240-251

Real-Time Raster to Quadtree and Quadtree to Raster Conversion Algorithms with Modest Storage RequirementsF. Warren Burton, V. J. Kollias, John G. Kollias. wi, 28(4):170-174, 1986.

Buddy Systems with Selective SplittingN. M. Pitman, F. Warren Burton, E. W. Haddon. cj, 29(2):127-134, 1986.

1985

1984

Annotations to Control Parallelism, Reduction Order in the Distributed Evaluation of Functional ProgramsF. Warren Burton. TOPLAS, 6(2):159-174, 1984. [doi]

Virtual Tree MachinesF. Warren Burton, Matthew M. Huntbach. TC, 33(3):278-280, 1984.

Consistency in Point-in-Point Polygon TestsF. Warren Burton, V. J. Kollias, John G. Kollias. cj, 27(4):375-376, 1984.

An implementation of the exponential pyramid data structure with application to determination of symmetries in picturesF. Warren Burton, John G. Kollias, Nikitas A. Alexandridis. cvgip, 25(2):218-225, 1984. [doi]

Lazy Evaluation of Geometric ObjectsF. Warren Burton, Matthew M. Huntbach. cga, 4(1):28-33, 1984. [doi]

1982

An Efficient Functional Implementation of FIFO QueuesF. Warren Burton. ipl, 14(5):205-206, 1982.

A Linear Space Translation of Functional Programs to Turner CombinatorsF. Warren Burton. ipl, 14(5):201-204, 1982.

1981

Abstract Data Types, Subtypes and Data IndependenceF. Warren Burton, Brian Lings. cj, 24(4):308-311, 1981.

Executing functional programs on a virtual tree of processorsF. Warren Burton, M. Ronan Sleep. fpca 1981: 187-194 [doi]

Expected Complexity of Fast Search with Uniformly Distributed DataGilbert N. Lewis, Nancy J. Boynton, F. Warren Burton. ipl, 13(1):4-7, 1981.

Towards a Zero Assignment Parallel ProcessorM. Ronan Sleep, F. Warren Burton. icdcs 1981: 80-85

1980

FACETS: A Language Feature for security and FlexibilityF. Warren Burton, Brian Lings. acj, 12(4):125-131, 1980.

A Robust Variation of Interpolation SearchF. Warren Burton, Gilbert N. Lewis. ipl, 10(4/5):198-201, 1980.

1979

Optimising Disc Head Movements in Secondary Key RetrievalsF. Warren Burton, John G. Kollias. cj, 22(3):206-208, 1979.

A FORTRAN Preprocessor to Support Encapsulated Data Abstraction DefinitionsF. Warren Burton. cj, 22(4):307-312, 1979.

1978

Comments on: Sorting by Distributive PartitioningF. Warren Burton. ipl, 7(4):205, 1978.

1976

Computer Processing of Points Curves and RegionsF. Warren Burton. PhD thesis, University of East Anglia, Norwich, UK, 1976. [doi]

Sign in or sign up to see more results.

runs on WebDSL