The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Lambert G. L. T. Meertens: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Adriaan van Wijngaarden, B. J. Mailloux, J. E. L. Peck, Cornelis H. A. Koster, Michel Sintzoff, C. H. Lindsey, Lambert G. L. T. Meertens, R. G. Fisker
    Revised Report on the Algorithmic Language ALGOL 68 [Citation Graph (4, 0)][DBLP]
    Acta Inf., 1975, v:5, n:, pp:1-236 [Journal]
  2. Roland Carl Backhouse, Patrik Jansson, Johan Jeuring, Lambert G. L. T. Meertens
    Generic Programming: An Introduction. [Citation Graph (0, 0)][DBLP]
    Advanced Functional Programming, 1998, pp:28-115 [Conf]
  3. Branislav Kusy, Ákos Lédeczi, Miklos Maroti, Lambert G. L. T. Meertens
    Node density independent localization. [Citation Graph (0, 0)][DBLP]
    IPSN, 2006, pp:441-448 [Conf]
  4. Richard S. Bird, Lambert G. L. T. Meertens
    Nested Datatypes. [Citation Graph (0, 0)][DBLP]
    MPC, 1998, pp:52-67 [Conf]
  5. Lambert G. L. T. Meertens
    Constructing a Calculus of Programs. [Citation Graph (0, 0)][DBLP]
    MPC, 1989, pp:66-90 [Conf]
  6. Lambert G. L. T. Meertens
    Calculate Polytypically! [Citation Graph (0, 0)][DBLP]
    PLILP, 1996, pp:1-16 [Conf]
  7. Lambert G. L. T. Meertens
    Incremental Polymorphic Type Checking in B. [Citation Graph (0, 0)][DBLP]
    POPL, 1983, pp:265-275 [Conf]
  8. Stephen Fitzpatrick, Lambert G. L. T. Meertens
    An Experimental Assessment of a Stochastic, Anytime, Decentralized, Soft Colourer for Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    SAGA, 2001, pp:49-64 [Conf]
  9. Evangelos Kranakis, Lambert G. L. T. Meertens
    Optimal packing of similar triangles. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1989, v:38, n:, pp:181-185 [Journal]
  10. Paul M. B. Vitányi, Lambert G. L. T. Meertens
    Big omega versus the wild functions. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1984, v:22, n:, pp:14-19 [Journal]
  11. Lambert G. L. T. Meertens
    Paramorphisms. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1992, v:4, n:5, pp:413-424 [Journal]
  12. Lambert G. L. T. Meertens
    A Space-Saving Technique for Assigning Algol 68 Multiple Values. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1976, v:5, n:4, pp:97-99 [Journal]
  13. J. W. de Bakker, Lambert G. L. T. Meertens
    On the Completeness of the Inductive Assertion Method. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1975, v:11, n:3, pp:323-357 [Journal]
  14. Lambert G. L. T. Meertens
    Calculating the Sieve of Eratosthenes. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 2004, v:14, n:6, pp:759-763 [Journal]
  15. Krzysztof R. Apt, Lambert G. L. T. Meertens
    Completeness with Finite Systems of Intermediate Assertions for Recursive Program Schemes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:4, pp:665-671 [Journal]
  16. Krzysztof R. Apt, Jan A. Bergstra, Lambert G. L. T. Meertens
    Recursive Assertions are not enough - or are they? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1979, v:8, n:, pp:73-87 [Journal]

Search in 0.020secs, Finished in 0.022secs
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