Alan Gibbons - RankMe

48 papers A* 4B 9Misc 1Journal 27Unranked 5

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