default search action
Alan Gibbons
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [j26]Alan Gibbons, Martyn Amos
:
Wave Propagation in Filamental Cellular Automata. Int. J. Nat. Comput. Res. 1(1): 56-69 (2010) - [c19]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: 523-524
2000 – 2009
- 2009
- [i1]Alan Gibbons, Martyn Amos:
On filamental cellular automata. CoRR abs/0907.3246 (2009) - 2007
- [b2]Michael Keating, David Flynn, Robert C. Aitken, Alan Gibbons, Kaijian Shi:
Low Power Methodology Manual - for System-on-Chip Design. Springer 2007, ISBN 978-0-387-71818-7, pp. I-XVI, 1-300 - [j25]Martyn Amos, David A. Hodgson, Alan Gibbons:
Bacterial Self-Organisation and Computation. Int. J. Unconv. Comput. 3(3): 199-210 (2007) - 2004
- [j24]Alan Gibbons, Paul Sant:
Rotation sequences and edge-colouring of binary tree pairs. Theor. Comput. Sci. 326(1-3): 409-418 (2004) - 2003
- [j23]Alan Gibbons, Aris Pagourtzis
Coarse-Grained Parallel Transitive Closure Algorithm: Path Decomposition Technique. Comput. J. 46(4): 391-400 (2003) - 2002
- [j22]Alan Gibbons, Ida Pu, Muthu Muthukrishnan:
Exact Analyses of a Simple Heuristic Employed in Array Compression. Comput. J. 45(2): 213-220 (2002) - [j21]Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter:
Deterministic broadcasting in ad hoc radio networks. Distributed Comput. 15(1): 27-38 (2002) - [c18]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 - 2001
- [j20]William Duckworth, Paul E. Dunne
Leafy spanning trees in hypercubes. Appl. Math. Lett. 14(7): 801-804 (2001) - [j19]Gerald G. Owenson, Martyn Amos
DNA-based logic. Soft Comput. 5(2): 102-105 (2001) - [j18]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
- [j17]Paul E. Dunne, Alan Gibbons:
J.UCS Special Issue on BCTCS. J. Univers. Comput. Sci. 6(4): 405-406 (2000) - [j16]Paul E. Dunne
Complexity-theoretic models of phase transitions in search problems. Theor. Comput. Sci. 249(2): 243-263 (2000) - [j15]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) - [c17]Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter:
Deterministic broadcasting in unknown radio networks. SODA 2000: 861-870
1990 – 1999
- 1999
- [c16]Gerald G. Owenson, Martyn Amos
Molecular implementation of computational components. CEC 1999: 967-971 - [c15]Leszek Gasieniec, Alan Gibbons, Wojciech Rytter:
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts. MFCS 1999: 48-58 - [c14]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
- [j14]Martyn Amos, Alan Gibbons, Paul E. Dunne:
Toward feasible and efficient DNA computation. Complex. 4(1): 20-24 (1998) - [c13]Ken J. Chan, Alan Gibbons, Marcelo Pias
On the PVM Computations of Transitive Closure and Algebraic Path Problems. PVM/MPI 1998: 338-345 - 1997
- [j13]Josep Díaz, Alan Gibbons, Grammati E. Pantziou
Parallel Algorithms for the Minimum Cut and the Minimum Length Tree Layout Problems. Theor. Comput. Sci. 181(2): 267-287 (1997) - [c12]Martyn Amos, Alan Gibbons, Paul E. Dunne:
The Complexity and Viability of DNA Computations. BCEC 1997: 165-173 - [c11]Vassil Alexandrow, Ken Chan, Alan Gibbons, Wojciech Rytter:
On the PVM/MPI Computations of Dynamic Programming Recurrences. PVM/MPI 1997: 305-312 - 1996
- [j12]Ladislav A. Novak, Alan Gibbons:
Double independence and tree pairs in graphs. Int. J. Circuit Theory Appl. 24(6): 657-666 (1996) - [j11]Artur Czumaj, Alan Gibbons:
Guthrie's Problem: New Equivalences and Rapid Reductions. Theor. Comput. Sci. 154(1): 3-22 (1996) - [c10]Martyn Amos, Alan Gibbons, David A. Hodgson:
Error-resistant implementation of DNA computations. DNA Based Computers 1996: 151-161 - [c9]Alan Gibbons, Martyn Amos, David A. Hodgson:
Models of DNA Computation. MFCS 1996: 18-36 - [c8]Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons:
RNC Algorithms for the Uniform Generation of Combinatorial Structures. SODA 1996: 429-437 - 1995
- [c7]Josep Díaz, Alan Gibbons, Grammati E. Pantziou
Efficient Parallel Algorithms for some Tree Layout Problems. COCOON 1995: 313-323 - 1993
- [j10]Ladislav A. Novak, Alan Gibbons:
Superperfect pairs of trees in graphs. Int. J. Circuit Theory Appl. 21(2): 183-189 (1993) - [j9]Somasundaram Ravindran, Alan Gibbons:
Dense Edge-Disjoint Embedding of Complete Binary Trees in the Hypercube. Inf. Process. Lett. 45(6): 321-325 (1993) - [c6]Artur Czumaj, Alan Gibbons:
Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs. ICALP 1993: 88-101 - [c5]N. W. Holloway, Somasundaram Ravindran, Alan Gibbons:
Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle Inequality. WG 1993: 11-20 - 1992
- [j8]Ladislav A. Novak, Alan Gibbons:
Perfect pairs of trees in graphs. Int. J. Circuit Theory Appl. 20(2): 201-208 (1992) - [j7]Ladislav A. Novak, Alan Gibbons:
Perfect pairs of trees associated with a prescribed tree: An algorithmic approach. Int. J. Circuit Theory Appl. 20(6): 681-688 (1992) - [c4]Alan Gibbons, Mike Paterson:
Dense Edge-Disjoint Embedding of Binary Trees in the Mesh. SPAA 1992: 257-263 - 1991
- [j6]Alan Gibbons, Ridha Ziani:
The Balanced Binary Tree Technique on Mesh-Connected Computers. Inf. Process. Lett. 37(2): 101-109 (1991) - [c3]Josep Díaz, Alan Gibbons, Mike Paterson, Jacobo Torán:
The MINSUMCUT Problem. WADS 1991: 65-89 - 1990
- [j5]Alan Gibbons, Wojciech Rytter:
Optimally Edge-Colouring Outerplanar Graphs is in NC. Theor. Comput. Sci. 71(3): 401-411 (1990)
1980 – 1989
- 1989
- [j4]Alan Gibbons, Wojciech Rytter:
Optimal Parallel Algorithm for Dynamic Expression Evaluation and Context-Free Recognition. Inf. Comput. 81(1): 32-45 (1989) - [j3]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
- [b1]Alan Gibbons, Wojciech Rytter:
Efficient parallel algorithms. Cambridge University Press 1988, ISBN 978-0-521-38841-2, pp. I-VIII, 1-259 - [j2]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
- [c2]Alan Gibbons, Wojciech Rytter:
Fast Parallel Algorithms for Optimal Edge-Colouring of some Tree-structured Graphs. FCT 1987: 155-162 - 1986
- [j1]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) - [c1]Alan Gibbons, Wojciech Rytter:
An Optimal Parallel Algorithm for Dynamic Expression Evaluation and Its Applications. FSTTCS 1986: 453-469
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: