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

Search the dblp DataBase

Title:
Author:
Christer Bäckström: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Peter Jonsson, Christer Bäckström
    Tractable Planning with State Variables by Exploiting Structural Restrictions. [Citation Graph (0, 0)][DBLP]
    AAAI, 1994, pp:998-1003 [Conf]
  2. Peter Jonsson, Christer Bäckström
    On the Size of Reactive Plans. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, Vol. 2, 1996, pp:1182-1187 [Conf]
  3. Peter Jonsson, Christer Bäckström
    A Linear-Programming Approach to Temporal Reasoning. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, Vol. 2, 1996, pp:1235-1240 [Conf]
  4. Bernhard Nebel, Christer Bäckström
    On the Computational Complexity of Temporal Projection and Plan Validation. [Citation Graph (0, 0)][DBLP]
    AAAI, 1992, pp:748-753 [Conf]
  5. Christer Bäckström
    Action Structures with Implicit Coordination. [Citation Graph (0, 0)][DBLP]
    AIMSA, 1988, pp:103-110 [Conf]
  6. Christer Bäckström
    Executing Parallel Plans Faster by Adding Actions. [Citation Graph (0, 0)][DBLP]
    ECAI, 1994, pp:615-619 [Conf]
  7. Christer Bäckström, Bernhard Nebel
    On the Computational Complexity of Planning and Story Understanding. [Citation Graph (0, 0)][DBLP]
    ECAI, 1992, pp:349-353 [Conf]
  8. Christer Bäckström, Inger Klein
    Planning in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Expert Systems in Engineering, 1990, pp:103-118 [Conf]
  9. Christer Bäckström, Peter Jonsson
    Planning with Abstraction Hierarchies can be Exponentially Less Efficient. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:1599-1605 [Conf]
  10. Christer Bäckström, Inger Klein
    Parallel Non-Binary Planning in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1991, pp:268-273 [Conf]
  11. Christer Bäckström, Bernhard Nebel
    Complexity Results for SAS+ Planning. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1993, pp:1430-1435 [Conf]
  12. Christer Bäckström
    A Representation of Coordinated Actions Characterized by Interval Valued Conditions. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1988, pp:220-229 [Conf]
  13. Christer Bäckström
    Equivalence and Tractability Results for SAS+ Planning. [Citation Graph (0, 0)][DBLP]
    KR, 1992, pp:126-137 [Conf]
  14. Peter Jonsson, Thomas Drakengren, Christer Bäckström
    Tractable Subclasses of the Point-Interval Algebra: A Complete Classification. [Citation Graph (0, 0)][DBLP]
    KR, 1996, pp:352-363 [Conf]
  15. Christer Bäckström
    A Representation of Coordinated Actions. [Citation Graph (0, 0)][DBLP]
    SCAI, 1988, pp:205-220 [Conf]
  16. Caj Södergård, Matti Aaltonen, Christer Bäckström, Ari Heinonen, Timo Järvinen, Timo Kinnunen, Pauliina Koivunen, Sari Lehtol, Ville Ollikainen, Katja Rentto, Mikko Seppälä, Antti Tammela
    An Integrated Multiple Media Portal with Semiautomatic Editing Features. [Citation Graph (0, 0)][DBLP]
    WWW Posters, 2001, pp:- [Conf]
  17. Inger Klein, Peter Jonsson, Christer Bäckström
    Efficient planning for a miniature assembly line. [Citation Graph (0, 0)][DBLP]
    AI in Engineering, 1999, v:13, n:1, pp:69-81 [Journal]
  18. Christer Bäckström
    Expressive Equivalence of Planning Formalisms. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1995, v:76, n:1-2, pp:17-34 [Journal]
  19. Peter Jonsson, Christer Bäckström
    State-Variable Planning Under Structural Restrictions: Algorithms and Complexity. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1998, v:100, n:1-2, pp:125-176 [Journal]
  20. Peter Jonsson, Christer Bäckström
    A Unifying Approach to Temporal Constraint Reasoning. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1998, v:102, n:1, pp:143-155 [Journal]
  21. Peter Jonsson, Thomas Drakengren, Christer Bäckström
    Computational Complexity of Relating Time Points with Intervals. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1999, v:109, n:1-2, pp:273-295 [Journal]
  22. Peter Jonsson, Patrik Haslum, Christer Bäckström
    Towards efficient universal planning: A randomized approach. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2000, v:117, n:1, pp:1-29 [Journal]
  23. Bernhard Nebel, Christer Bäckström
    On the Computational Complexity of Temporal Projection, Planning, and Plan Validation. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1994, v:66, n:1, pp:125-160 [Journal]
  24. Peter Jonsson, Christer Bäckström
    Tractable Plan Existence Does Not Imply Tractable Plan Generation. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1998, v:22, n:3-4, pp:281-296 [Journal]
  25. Christer Bäckström, Inger Klein
    Planning in polynomial time: the SAS-PUBS class. [Citation Graph (0, 0)][DBLP]
    Computational Intelligence, 1991, v:7, n:, pp:181-197 [Journal]
  26. Christer Bäckström, Bernhard Nebel
    Complexity Results for SAS+ Planning. [Citation Graph (0, 0)][DBLP]
    Computational Intelligence, 1995, v:11, n:, pp:625-656 [Journal]
  27. Ville Ollikainen, Christer Bäckström, Samuel Kaski
    Electronic editor: automatic content-based sequential compilation of newspaper articles. [Citation Graph (0, 0)][DBLP]
    Neurocomputing, 2002, v:43, n:1-4, pp:91-106 [Journal]
  28. Christer Bäckström
    Computational Aspects of Reordering Plans. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 1998, v:9, n:, pp:99-137 [Journal]

  29. An integrated multiple media news portal. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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