The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Viktor K. Sabelfeld: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Christian Blumenröhr, Viktor K. Sabelfeld
    Formal Synthesis at the Algorithmic Level. [Citation Graph (0, 0)][DBLP]
    CHARME, 1999, pp:187-201 [Conf]
  2. Kai Kapp, Viktor K. Sabelfeld
    Automatic correct scheduling of control flow intensive behavioral descriptions in formal synthesis. [Citation Graph (0, 0)][DBLP]
    DAC, 2004, pp:61-66 [Conf]
  3. Viktor K. Sabelfeld
    Procedure implementation in a multi-language translator. [Citation Graph (0, 0)][DBLP]
    Methods of Algorithmic Language Implementation, 1975, pp:80-89 [Conf]
  4. Viktor K. Sabelfeld
    Analysis of Some Semantic Properties for Programs of the Applicative Language AL. [Citation Graph (0, 0)][DBLP]
    Formal Methods in Programming and Their Applications, 1993, pp:181-189 [Conf]
  5. Viktor K. Sabelfeld
    The Tree Equivalence Problem for Linear Recursion Schemes. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 1996, pp:350-361 [Conf]
  6. Viktor K. Sabelfeld, Christian Blumenröhr, Kai Kapp
    Semantics and Transformations in Formal Synthesis at System Level. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 2001, pp:149-156 [Conf]
  7. Viktor K. Sabelfeld, Kai Kapp
    Numeric Types in Formal Synthesis. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 2003, pp:79-90 [Conf]
  8. Klaus Schneider, Viktor K. Sabelfeld
    Introducing Mutual Exclusion in Esterel. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 1999, pp:445-459 [Conf]
  9. Viktor K. Sabelfeld, Andrei Sabelfeld
    Simple Semantic Analysis Problems for Functional Programs. [Citation Graph (0, 0)][DBLP]
    ICFP, 1997, pp:319- [Conf]
  10. Viktor K. Sabelfeld
    Äquivalente Transformationen für Flußdiagramme. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1978, v:10, n:, pp:127-155 [Journal]
  11. Viktor K. Sabelfeld
    The Logic-Termal Equivalence is Polynomial-Time Decidable. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:2, pp:57-62 [Journal]
  12. Viktor K. Sabelfeld
    Tree Equivalence of Linear Recursive Schemata is Polynomial-Time Decidable. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:147-153 [Journal]
  13. Viktor K. Sabelfeld
    The tree equivalence of linear recursion schemes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:238, n:1-2, pp:1-29 [Journal]
  14. Viktor K. Sabelfeld
    An Algorithm Deciding Functional Equivalence in a New Class of Program Schemes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:71, n:2, pp:265-279 [Journal]

Search in 0.002secs, Finished in 0.002secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002