The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alan Gibbons: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  36. What's cool for the future of ultra low power designs? [Citation Graph (, )][DBLP]


  37. On filamental cellular automata [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002