Alan Gibbons

Publication Activity (10 Years)

Years Active: 1986-2010
Publications (10 Years): 0

Publications

Alan Gibbons, Martyn Amos
Wave Propagation in Filamental Cellular Automata. Int. J. Nat. Comput. Res. 1 (1) (2010)
Nagaraj Ns, John Byler, Koorosh Nazifi, Venugopal Puvvada, Toshiyuki Saito, Alan Gibbons, S. Balajee
What's cool for the future of ultra low power designs? DAC (2010)
Alan Gibbons, Martyn Amos
On filamental cellular automata CoRR (2009)
Martyn Amos, David A. Hodgson, Alan Gibbons
Bacterial Self-Organisation and Computation. Int. J. Unconv. Comput. 3 (3) (2007)
Alan Gibbons, Paul Sant
Rotation sequences and edge-colouring of binary tree pairs. Theor. Comput. Sci. 326 (1-3) (2004)
Alan Gibbons, Aris Pagourtzis, Igor Potapov, Wojciech Rytter
Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique. Comput. J. 46 (4) (2003)
Alan Gibbons, Paul Sant
Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps. MFCS (2002)
Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter
Deterministic broadcasting in ad hoc radio networks. Distributed Comput. 15 (1) (2002)
Alan Gibbons, Ida Pu, Muthu Muthukrishnan
Exact Analyses of a Simple Heuristic Employed in Array Compression. Comput. J. 45 (2) (2002)
Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito
Efficient web searching using temporal factors. Theor. Comput. Sci. 262 (1) (2001)
William Duckworth, Paul E. Dunne, Alan Gibbons, Michele Zito
Leafy spanning trees in hypercubes. Appl. Math. Lett. 14 (7) (2001)
Gerald G. Owenson, Martyn Amos, David A. Hodgson, Alan Gibbons
DNA-based logic. Soft Comput. 5 (2) (2001)
Somasundaram Ravindran, Alan Gibbons, Mike Paterson
Dense edge-disjoint embedding of complete binary trees in interconnection networks. Theor. Comput. Sci. 249 (2) (2000)
Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter
Deterministic broadcasting in unknown radio networks. SODA (2000)
Paul E. Dunne, Alan Gibbons, Michele Zito
Complexity-theoretic models of phase transitions in search problems. Theor. Comput. Sci. 249 (2) (2000)
Paul E. Dunne, Alan Gibbons
J.UCS Special Issue on BCTCS. J. Univers. Comput. Sci. 6 (4) (2000)
Gerald G. Owenson, Martyn Amos, David A. Hodgson, Alan Gibbons
Molecular implementation of computational components. CEC (1999)
Leszek Gasieniec, Alan Gibbons, Wojciech Rytter
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts. MFCS (1999)
Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito
Efficient Web Searching Using Temporal Factors. WADS (1999)
Ken J. Chan, Alan Gibbons, Marcelo Pias, Wojciech Rytter
On the PVM Computations of Transitive Closure and Algebraic Path Problems. PVM/MPI (1998)
Martyn Amos, Alan Gibbons, Paul E. Dunne
Toward feasible and efficient DNA computation. Complex. 4 (1) (1998)
Vassil Alexandrow, Ken Chan, Alan Gibbons, Wojciech Rytter
On the PVM/MPI Computations of Dynamic Programming Recurrences. PVM/MPI (1997)
Josep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán
Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems. Theor. Comput. Sci. 181 (2) (1997)
Martyn Amos, Alan Gibbons, Paul E. Dunne
The Complexity and Viability of DNA Computations. BCEC (1997)
Martyn Amos, Alan Gibbons, David A. Hodgson
Error-resistant implementation of DNA computations. DNA Based Computers (1996)
Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons
RNC Algorithms for the Uniform Generation of Combinatorial Structures. SODA (1996)
Ladislav A. Novak, Alan Gibbons
Double independence and tree pairs in graphs. Int. J. Circuit Theory Appl. 24 (6) (1996)
Alan Gibbons, Martyn Amos, David A. Hodgson
Models of DNA Computation. MFCS (1996)
Artur Czumaj, Alan Gibbons
Guthrie's Problem: New Equivalences and Rapid Reductions. Theor. Comput. Sci. 154 (1) (1996)
Josep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán
Efficient Parallel Algorithms for some Tree Layout Problems. COCOON (1995)
Ladislav A. Novak, Alan Gibbons
Superperfect pairs of trees in graphs. Int. J. Circuit Theory Appl. 21 (2) (1993)
Artur Czumaj, Alan Gibbons
Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs. ICALP (1993)
N. W. Holloway, Somasundaram Ravindran, Alan Gibbons
Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle Inequality. WG (1993)
Somasundaram Ravindran, Alan Gibbons
Dense Edge-Disjoint Embedding of Complete Binary Trees in the Hypercube. Inf. Process. Lett. 45 (6) (1993)
Alan Gibbons, Mike Paterson
Dense Edge-Disjoint Embedding of Binary Trees in the Mesh. SPAA (1992)
Ladislav A. Novak, Alan Gibbons
Perfect pairs of trees associated with a prescribed tree: An algorithmic approach. Int. J. Circuit Theory Appl. 20 (6) (1992)
Ladislav A. Novak, Alan Gibbons
Perfect pairs of trees in graphs. Int. J. Circuit Theory Appl. 20 (2) (1992)
Josep Díaz, Alan Gibbons, Mike Paterson, Jacobo Torán
The MINSUMCUT Problem. WADS (1991)
Alan Gibbons, Ridha Ziani
The Balanced Binary Tree Technique on Mesh-Connected Computers. Inf. Process. Lett. 37 (2) (1991)
Alan Gibbons, Wojciech Rytter
Optimally Edge-Colouring Outerplanar Graphs is in NC. Theor. Comput. Sci. 71 (3) (1990)
Alan Gibbons, Wojciech Rytter
Optimal Parallel Algorithm for Dynamic Expression Evaluation and Context-Free Recognition Inf. Comput. 81 (1) (1989)
Alan Gibbons, Y. N. Srikant
A Class of Problems Efficiently Solvable on Mesh-Connected Computers Including Dynamic Expression Evaluation. Inf. Process. Lett. 32 (6) (1989)
Alan Gibbons, Amos Israeli, Wojciech Rytter
Parallel O(log n) Time Edge-Colouring of Trees and Halin Graphs. Inf. Process. Lett. 27 (1) (1988)
Alan Gibbons, Wojciech Rytter
Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs. FCT (1987)
Alan Gibbons, Wojciech Rytter
An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications. FSTTCS (1986)
Alan Gibbons, Wojciech Rytter
On the Decidability of Some Problems about Rational Subsets of Free Partially Commutative Monoids. Theor. Comput. Sci. 48 (3) (1986)