2004 |
35 | EE | Alan Gibbons,
Paul Sant:
Rotation sequences and edge-colouring of binary tree pairs.
Theor. Comput. Sci. 326(1-3): 409-418 (2004) |
2003 |
34 | EE | Alan Gibbons,
Aris Pagourtzis,
Igor Potapov,
Wojciech Rytter:
Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique.
Comput. J. 46(4): 391-400 (2003) |
2002 |
33 | EE | Alan Gibbons,
Paul Sant:
Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps.
MFCS 2002: 25-39 |
32 | EE | Alan Gibbons,
Ida Pu,
Muthu Muthukrishnan:
Exact Analyses of a Simple Heuristic Employed in Array Compression.
Comput. J. 45(2): 213-220 (2002) |
31 | EE | Bogdan S. Chlebus,
Leszek Gasieniec,
Alan Gibbons,
Andrzej Pelc,
Wojciech Rytter:
Deterministic broadcasting in ad hoc radio networks.
Distributed Computing 15(1): 27-38 (2002) |
2001 |
30 | EE | William Duckworth,
Paul E. Dunne,
Alan Gibbons,
Michele Zito:
Leafy spanning trees in hypercubes.
Appl. Math. Lett. 14(7): 801-804 (2001) |
29 | EE | Gerald G. Owenson,
Martyn Amos,
David Hodgson,
Alan Gibbons:
DNA-based logic.
Soft Comput. 5(2): 102-105 (2001) |
28 | EE | 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): 569-582 (2001) |
2000 |
27 | EE | Bogdan S. Chlebus,
Leszek Gasieniec,
Alan Gibbons,
Andrzej Pelc,
Wojciech Rytter:
Deterministic broadcasting in unknown radio networks.
SODA 2000: 861-870 |
26 | EE | Paul E. Dunne,
Alan Gibbons:
J.UCS Special Issue on BCTCS.
J. UCS 6(4): 405-406 (2000) |
25 | EE | Paul E. Dunne,
Alan Gibbons,
Michele Zito:
Complexity-theoretic models of phase transitions in search problems.
Theor. Comput. Sci. 249(2): 243-263 (2000) |
24 | EE | Somasundaram Ravindran,
Alan Gibbons,
Mike Paterson:
Dense edge-disjoint embedding of complete binary trees in interconnection networks.
Theor. Comput. Sci. 249(2): 325-342 (2000) |
1999 |
23 | | Leszek Gasieniec,
Alan Gibbons,
Wojciech Rytter:
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts.
MFCS 1999: 48-58 |
22 | EE | Artur Czumaj,
Ian Finch,
Leszek Gasieniec,
Alan Gibbons,
Paul H. Leng,
Wojciech Rytter,
Michele Zito:
Efficient Web Searching Using Temporal Factors.
WADS 1999: 294-305 |
1998 |
21 | EE | Ken J. Chan,
Alan Gibbons,
Marcelo Pias,
Wojciech Rytter:
On the PVM Computations of Transitive Closure and Algebraic Path Problems.
PVM/MPI 1998: 338-345 |
1997 |
20 | | Martyn Amos,
Alan Gibbons,
Paul E. Dunne:
The Complexity and Viability of DNA Computations.
BCEC 1997: 165-173 |
19 | | Vassil Alexandrow,
Ken Chan,
Alan Gibbons,
Wojciech Rytter:
On the PVM/MPI Computations of Dynamic Programming Recurrences.
PVM/MPI 1997: 305-312 |
18 | EE | 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): 267-287 (1997) |
1996 |
17 | | Alan Gibbons,
Martyn Amos,
David Hodgson:
Models of DNA Computation.
MFCS 1996: 18-36 |
16 | | Michele Zito,
Ida Pu,
Martyn Amos,
Alan Gibbons:
RNC Algorithms for the Uniform Generation of Combinatorial Structures.
SODA 1996: 429-437 |
15 | EE | Artur Czumaj,
Alan Gibbons:
Guthrie's Problem: New Equivalences and Rapid Reductions.
Theor. Comput. Sci. 154(1): 3-22 (1996) |
1995 |
14 | | 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: 313-323 |
1993 |
13 | | Artur Czumaj,
Alan Gibbons:
Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs.
ICALP 1993: 88-101 |
12 | | N. W. Holloway,
Somasundaram Ravindran,
Alan Gibbons:
Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle Inequality.
WG 1993: 11-20 |
11 | | Somasundaram Ravindran,
Alan Gibbons:
Dense Edge-Disjoint Embedding of Complete Binary Trees in the Hypercube.
Inf. Process. Lett. 45(6): 321-325 (1993) |
1992 |
10 | EE | Alan Gibbons,
Mike Paterson:
Dense Edge-Disjoint Embedding of Binary Trees in the Mesh.
SPAA 1992: 257-263 |
1991 |
9 | | Josep Díaz,
Alan Gibbons,
Mike Paterson,
Jacobo Torán:
The MINSUMCUT Problem.
WADS 1991: 65-89 |
8 | | Alan Gibbons,
Ridha Ziani:
The Balanced Binary Tree Technique on Mesh-Connected Computers.
Inf. Process. Lett. 37(2): 101-109 (1991) |
1990 |
7 | | Alan Gibbons,
Wojciech Rytter:
Optimally Edge-Colouring Outerplanar Graphs is in NC.
Theor. Comput. Sci. 71(3): 401-411 (1990) |
1989 |
6 | | Alan Gibbons,
Wojciech Rytter:
Optimal Parallel Algorithm for Dynamic Expression Evaluation and Context-Free Recognition
Inf. Comput. 81(1): 32-45 (1989) |
5 | | Alan Gibbons,
Y. N. Srikant:
A Class of Problems Efficiently Solvable on Mesh-Connected Computers Including Dynamic Expression Evaluation.
Inf. Process. Lett. 32(6): 305-311 (1989) |
1988 |
4 | | Alan Gibbons,
Amos Israeli,
Wojciech Rytter:
Parallel O(log n) Time Edge-Colouring of Trees and Halin Graphs.
Inf. Process. Lett. 27(1): 43-51 (1988) |
1987 |
3 | | Alan Gibbons,
Wojciech Rytter:
Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs.
FCT 1987: 155-162 |
1986 |
2 | | Alan Gibbons,
Wojciech Rytter:
An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications.
FSTTCS 1986: 453-469 |
1 | | Alan Gibbons,
Wojciech Rytter:
On the Decidability of Some Problems about Rational Subsets of Free Partially Commutative Monoids.
Theor. Comput. Sci. 48(3): 329-337 (1986) |