Alan Gibbons

According to our database, Alan Gibbons authored at least 47 papers between 1986 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2010

Wave Propagation in Filamental Cellular Automata.

Alan Gibbons, Martyn Amos

Int. J. Nat. Comput. Res., 2010

What's cool for the future of ultra low power designs?

Nagaraj Ns, John Byler, Koorosh Nazifi, Venugopal Puvvada, Toshiyuki Saito, Alan Gibbons, S. Balajee

Proceedings of the 47th Design Automation Conference, 2010

2009

On filamental cellular automata

Alan Gibbons, Martyn Amos

CoRR, 2009

2007

Bacterial Self-Organisation and Computation.

Martyn Amos, David A. Hodgson, Alan Gibbons

Int. J. Unconv. Comput., 2007

Low Power Methodology Manual - for System-on-Chip Design.

Michael Keating, David Flynn, Robert C. Aitken, Alan Gibbons, Kaijian Shi

Springer, ISBN: 978-0-387-71818-7, 2007

2004

Rotation sequences and edge-colouring of binary tree pairs.

Alan Gibbons, Paul Sant

Theor. Comput. Sci., 2004

2003

Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique.

Alan Gibbons, Aris Pagourtzis, Igor Potapov, Wojciech Rytter

Comput. J., 2003

2002

Deterministic broadcasting in ad hoc radio networks.

Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter

Distributed Comput., 2002

Exact Analyses of a Simple Heuristic Employed in Array Compression.

Alan Gibbons, Ida Pu, Muthu Muthukrishnan

Comput. J., 2002

Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps.

Alan Gibbons, Paul Sant

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001

Efficient web searching using temporal factors.

Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito

Theor. Comput. Sci., 2001

DNA-based logic.

Gerald G. Owenson, Martyn Amos, David A. Hodgson, Alan Gibbons

Soft Comput., 2001

Leafy spanning trees in hypercubes.

William Duckworth, Paul E. Dunne, Alan Gibbons, Michele Zito

Appl. Math. Lett., 2001

2000

Dense edge-disjoint embedding of complete binary trees in interconnection networks.

Somasundaram Ravindran, Alan Gibbons, Mike Paterson

Theor. Comput. Sci., 2000

Complexity-theoretic models of phase transitions in search problems.

Paul E. Dunne, Alan Gibbons, Michele Zito

Theor. Comput. Sci., 2000

J.UCS Special Issue on BCTCS.

Paul E. Dunne, Alan Gibbons

J. Univers. Comput. Sci., 2000

Deterministic broadcasting in unknown radio networks.

Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts.

Leszek Gasieniec, Alan Gibbons, Wojciech Rytter

Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

Molecular implementation of computational components.

Gerald G. Owenson, Martyn Amos, David A. Hodgson, Alan Gibbons

Proceedings of the 1999 Congress on Evolutionary Computation, 1999

1998

Toward feasible and efficient DNA computation.

Martyn Amos, Alan Gibbons, Paul E. Dunne

Complex., 1998

On the PVM Computations of Transitive Closure and Algebraic Path Problems.

Ken J. Chan, Alan Gibbons, Marcelo Pias, Wojciech Rytter

Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 1998

1997

Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems.

Josep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán

Theor. Comput. Sci., 1997

On the PVM/MPI Computations of Dynamic Programming Recurrences.

Vassil Alexandrow, Ken Chan, Alan Gibbons, Wojciech Rytter

Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 1997

The Complexity and Viability of DNA Computations.

Martyn Amos, Alan Gibbons, Paul E. Dunne

Proceedings of the Biocomputing and emergent computation: Proceedings of BCEC97, 1997

1996

Guthrie's Problem: New Equivalences and Rapid Reductions.

Artur Czumaj, Alan Gibbons

Theor. Comput. Sci., 1996

Double independence and tree pairs in graphs.

Ladislav A. Novak, Alan Gibbons

Int. J. Circuit Theory Appl., 1996

RNC Algorithms for the Uniform Generation of Combinatorial Structures.

Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons

Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Models of DNA Computation.

Alan Gibbons, Martyn Amos, David A. Hodgson

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

Error-resistant implementation of DNA computations.

Martyn Amos, Alan Gibbons, David A. Hodgson

Proceedings of the DNA Based Computers, 1996

1995

Efficient Parallel Algorithms for some Tree Layout Problems.

Josep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1993

Dense Edge-Disjoint Embedding of Complete Binary Trees in the Hypercube.

Somasundaram Ravindran, Alan Gibbons

Inf. Process. Lett., 1993

Superperfect pairs of trees in graphs.

Ladislav A. Novak, Alan Gibbons

Int. J. Circuit Theory Appl., 1993

Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle Inequality.

N. W. Holloway, Somasundaram Ravindran, Alan Gibbons

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs.

Artur Czumaj, Alan Gibbons

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992

Perfect pairs of trees associated with a prescribed tree: An algorithmic approach.

Ladislav A. Novak, Alan Gibbons

Int. J. Circuit Theory Appl., 1992

Perfect pairs of trees in graphs.

Ladislav A. Novak, Alan Gibbons

Int. J. Circuit Theory Appl., 1992

Dense Edge-Disjoint Embedding of Binary Trees in the Mesh.

Alan Gibbons, Mike Paterson

Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

1991

The Balanced Binary Tree Technique on Mesh-Connected Computers.

Alan Gibbons, Ridha Ziani

Inf. Process. Lett., 1991

The MINSUMCUT Problem.

Josep Díaz, Alan Gibbons, Mike Paterson, Jacobo Torán

Proceedings of the Algorithms and Data Structures, 1991

1990

Optimally Edge-Colouring Outerplanar Graphs is in NC.

Alan Gibbons, Wojciech Rytter

Theor. Comput. Sci., 1990

1989

Optimal Parallel Algorithm for Dynamic Expression Evaluation and Context-Free Recognition

Alan Gibbons, Wojciech Rytter

Inf. Comput., April, 1989

A Class of Problems Efficiently Solvable on Mesh-Connected Computers Including Dynamic Expression Evaluation.

Alan Gibbons, Y. N. Srikant

Inf. Process. Lett., 1989

1988

Parallel O(log n) Time Edge-Colouring of Trees and Halin Graphs.

Alan Gibbons, Amos Israeli, Wojciech Rytter

Inf. Process. Lett., 1988

Efficient parallel algorithms.

Alan Gibbons, Wojciech Rytter

Cambridge University Press, ISBN: 978-0-521-38841-2, 1988

1987

Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs.

Alan Gibbons, Wojciech Rytter

Proceedings of the Fundamentals of Computation Theory, 1987

1986

On the Decidability of Some Problems about Rational Subsets of Free Partially Commutative Monoids.

Alan Gibbons, Wojciech Rytter

Theor. Comput. Sci., 1986

An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications.

Alan Gibbons, Wojciech Rytter

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986