The SCEAS System
Navigation Menu

Search the dblp DataBase


Jean-Philippe Dubernard: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Maylis Delest, Jean-Philippe Dubernard
    q-Grammars: Results, Implementation. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:377-388 [Conf]
  2. Jean-Philippe Dubernard, Dominique Geniet
    Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions. [Citation Graph (0, 0)][DBLP]
    CIAA, 2001, pp:87-100 [Conf]
  3. Maylis Delest, Jean-Philippe Dubernard, I. Dutour
    Parallelogram Polyominoes and Corners. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1995, v:20, n:5/6, pp:503-515 [Journal]
  4. Dominique Geniet, Jean-Philippe Dubernard
    Scheduling hard sporadic tasks with regular languages and generating functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:313, n:1, pp:119-132 [Journal]
  5. Jean-Philippe Dubernard, I. Dutour
    Enumération de polyominos convexes dirigés. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:157, n:1-3, pp:79-90 [Journal]

  6. Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L). [Citation Graph (, )][DBLP]

  7. Geometricity of Binary Regular Languages. [Citation Graph (, )][DBLP]

Search in 0.001secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002