The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

M. D. Atkinson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. M. D. Atkinson, J. S. Heslop-Harrison
    A simple method of hidden-line removal in three-dimensional modelling: hiding the problem behind filled polygons. [Citation Graph (0, 0)][DBLP]
    Computer Applications in the Biosciences, 1990, v:6, n:1, pp:55-56 [Journal]
  2. M. D. Atkinson
    The Recursive Structure of Some Ordering Problems. [Citation Graph (0, 0)][DBLP]
    BIT, 1991, v:31, n:2, pp:194-201 [Journal]
  3. M. D. Atkinson, Murali Thiyagarajah
    The Permutational Power of a Priority Queue. [Citation Graph (0, 0)][DBLP]
    BIT, 1993, v:33, n:1, pp:2-6 [Journal]
  4. M. D. Atkinson, Jörg-Rüdiger Sack, Nicola Santoro, Thomas Strothotte
    Min-Max Heaps and Generalized Priority Queues. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1986, v:29, n:10, pp:996-1000 [Journal]
  5. M. D. Atkinson
    Permutation Groups and Set Union Algorithms. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1980, v:23, n:2, pp:187- [Journal]
  6. M. D. Atkinson
    Uniform Generation of Rooted Ordered Trees with Prescribed Degrees. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1993, v:36, n:6, pp:593-594 [Journal]
  7. M. D. Atkinson
    Permutations which are the Union of an Increasing and a Decreasing Subsequence. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1998, v:5, n:, pp:- [Journal]
  8. M. D. Atkinson, S. A. Linton, L. A. Walker
    Priority Queues and Multisets. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1995, v:2, n:, pp:- [Journal]
  9. M. D. Atkinson
    Generalized Stack Permutations. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:3, pp:239-246 [Journal]
  10. M. D. Atkinson
    The Cyclic Towers of Hanoi. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:3, pp:118-119 [Journal]
  11. M. D. Atkinson, H. W. Chang
    Computing the Number of Mergings with Constraints. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:5, pp:289-292 [Journal]
  12. M. D. Atkinson, Nicola Santoro
    A Practical Algorithm for Boolean Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:29, n:1, pp:37-38 [Journal]
  13. M. D. Atkinson, Jörg-Rüdiger Sack
    Generating Binary Trees at Random. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:41, n:1, pp:21-23 [Journal]
  14. M. D. Atkinson, Jörg-Rüdiger Sack
    Uniform Generation of Forests of Restricted Height. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:50, n:6, pp:323-327 [Journal]
  15. M. D. Atkinson, Jörg-Rüdiger Sack
    Pop-Stacks in Parallel. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:70, n:2, pp:63-67 [Journal]
  16. M. D. Atkinson, Louise Walker
    Enumerating k-Way Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:48, n:2, pp:73-75 [Journal]
  17. M. D. Atkinson
    An Optimal Algorithm for Geometrical Congruence. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:2, pp:159-172 [Journal]
  18. M. D. Atkinson, Jörg-Rüdiger Sack
    Uniform Generation of Binary Trees in Parallel. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:23, n:1, pp:101-103 [Journal]
  19. M. D. Atkinson, R. A. Hassan
    On the Computation of Group Characters. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1986, v:2, n:1, pp:45-50 [Journal]
  20. M. D. Atkinson, Robert Beals
    Priority Queues and Permutations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:6, pp:1225-1230 [Journal]
  21. M. D. Atkinson, S. Lloyd
    The Ranks of m * n * (mn-2) Tensors. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:4, pp:611-615 [Journal]
  22. M. D. Atkinson
    The Complexity of Group Algebra Computations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1977, v:5, n:2, pp:205-209 [Journal]
  23. M. D. Atkinson, Mike Livesey, D. Tulley
    Permutations Generated by Token Passing in Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:178, n:1-2, pp:103-118 [Journal]
  24. M. D. Atkinson, D. Tulley
    Bounded Capacity Priority Queues. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:182, n:1-2, pp:145-157 [Journal]
  25. M. D. Atkinson, Hans P. van Ditmarsch, S. Roehling
    Avoiding bias in cards cryptography [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  26. M. D. Atkinson, Alberto Negro, Nicola Santoro
    Sums of lexicographically ordered sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:80, n:2, pp:115-122 [Journal]
  27. M. D. Atkinson
    Restricted permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:195, n:1-3, pp:27-38 [Journal]

Search in 0.004secs, Finished in 0.006secs
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