Alan Gibbons

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2010
Wave Propagation in Filamental Cellular Automata.
Int. J. Nat. Comput. Res., 2010

What's cool for the future of ultra low power designs?
Proceedings of the 47th Design Automation Conference, 2010

2009
On filamental cellular automata
CoRR, 2009

2007
Bacterial Self-Organisation and Computation.
Int. J. Unconv. Comput., 2007

Low Power Methodology Manual - for System-on-Chip Design.
Springer, ISBN: 978-0-387-71818-7, 2007

2004
Rotation sequences and edge-colouring of binary tree pairs.
Theor. Comput. Sci., 2004

2003
Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique.
Comput. J., 2003

2002
Deterministic broadcasting in ad hoc radio networks.
Distributed Comput., 2002

Exact Analyses of a Simple Heuristic Employed in Array Compression.
Comput. J., 2002

Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps.
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001
Efficient web searching using temporal factors.
Theor. Comput. Sci., 2001

DNA-based logic.
Soft Comput., 2001

Leafy spanning trees in hypercubes.
Appl. Math. Lett., 2001

2000
Dense edge-disjoint embedding of complete binary trees in interconnection networks.
Theor. Comput. Sci., 2000

Complexity-theoretic models of phase transitions in search problems.
Theor. Comput. Sci., 2000

J.UCS Special Issue on BCTCS.
J. Univers. Comput. Sci., 2000

Deterministic broadcasting in unknown radio networks.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts.
Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

Molecular implementation of computational components.
Proceedings of the 1999 Congress on Evolutionary Computation, 1999

1998
Toward feasible and efficient DNA computation.
Complex., 1998

On the PVM Computations of Transitive Closure and Algebraic Path Problems.
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.
Theor. Comput. Sci., 1997

On the PVM/MPI Computations of Dynamic Programming Recurrences.
Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 1997

The Complexity and Viability of DNA Computations.
Proceedings of the Biocomputing and emergent computation: Proceedings of BCEC97, 1997

1996
Guthrie's Problem: New Equivalences and Rapid Reductions.
Theor. Comput. Sci., 1996

Double independence and tree pairs in graphs.
Int. J. Circuit Theory Appl., 1996

RNC Algorithms for the Uniform Generation of Combinatorial Structures.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

Models of DNA Computation.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

Error-resistant implementation of DNA computations.
Proceedings of the DNA Based Computers, 1996

1995
Efficient Parallel Algorithms for some Tree Layout Problems.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1993
Dense Edge-Disjoint Embedding of Complete Binary Trees in the Hypercube.
Inf. Process. Lett., 1993

Superperfect pairs of trees in graphs.
Int. J. Circuit Theory Appl., 1993

Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle Inequality.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992
Perfect pairs of trees associated with a prescribed tree: An algorithmic approach.
Int. J. Circuit Theory Appl., 1992

Perfect pairs of trees in graphs.
Int. J. Circuit Theory Appl., 1992

Dense Edge-Disjoint Embedding of Binary Trees in the Mesh.
Proceedings of the 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992

1991
The Balanced Binary Tree Technique on Mesh-Connected Computers.
Inf. Process. Lett., 1991

The MINSUMCUT Problem.
Proceedings of the Algorithms and Data Structures, 1991

1990
Optimally Edge-Colouring Outerplanar Graphs is in NC.
Theor. Comput. Sci., 1990

1989
Optimal Parallel Algorithm for Dynamic Expression Evaluation and Context-Free Recognition
Inf. Comput., April, 1989

A Class of Problems Efficiently Solvable on Mesh-Connected Computers Including Dynamic Expression Evaluation.
Inf. Process. Lett., 1989

1988
Parallel O(log n) Time Edge-Colouring of Trees and Halin Graphs.
Inf. Process. Lett., 1988

Efficient parallel algorithms.
Cambridge University Press, ISBN: 978-0-521-38841-2, 1988

1987
Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs.
Proceedings of the Fundamentals of Computation Theory, 1987

1986
On the Decidability of Some Problems about Rational Subsets of Free Partially Commutative Monoids.
Theor. Comput. Sci., 1986

An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986


  Loading...