The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jirí Adámek: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jirí Adámek, Frantisek Plasil
    Partial Bindings of Components - Any Harm?. [Citation Graph (0, 0)][DBLP]
    APSEC, 2004, pp:632-639 [Conf]
  2. Jirí Adámek
    Algebra 'cap' Coalgebra = Presheaves. [Citation Graph (0, 0)][DBLP]
    CALCO, 2005, pp:67-82 [Conf]
  3. Jirí Adámek
    A Logic of Coequations. [Citation Graph (0, 0)][DBLP]
    CSL, 2005, pp:70-86 [Conf]
  4. Jirí Adámek
    Observability and Nerode Equivalence in Concrete C5ategories. [Citation Graph (0, 0)][DBLP]
    FCT, 1981, pp:1-15 [Conf]
  5. Jirí Adámek, Václav Koubek
    Remarks on Fixed Points of Functors. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:199-205 [Conf]
  6. Jirí Adámek, Vera Trnková
    Recognizable and Regular Languages in a Category. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:206-211 [Conf]
  7. Vera Trnková, Jirí Adámek
    Tree-group automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1979, pp:462-468 [Conf]
  8. Jirí Adámek, Stefan Milius, Jiri Velebil
    Parametric corecursion and completely iterative monads. [Citation Graph (0, 0)][DBLP]
    FICS, 2002, pp:2-5 [Conf]
  9. Vladimir Mencl, Frantisek Plasil, Jirí Adámek
    Behavior Assembly and Composition of Use Cases - UML 2.0 Perspective. [Citation Graph (0, 0)][DBLP]
    IASTED Conf. on Software Engineering, 2005, pp:193-201 [Conf]
  10. Jirí Adámek
    Automata and Categories: Finiteness Contra Minimality. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:160-166 [Conf]
  11. Vera Trnková, Jirí Adámek
    On Languages, Accepted by Machines in the Category of Sets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1977, pp:523-531 [Conf]
  12. Jirí Adámek, Horst Herrlich
    Cartesian Closed Categories, Quasitopoi and Topological Universes. [Citation Graph (0, 0)][DBLP]
    Mathematical Foundations of Programming Semantics, 1985, pp:20-41 [Conf]
  13. Jirí Adámek
    Static analysis of component systems using behavior protocols. [Citation Graph (0, 0)][DBLP]
    OOPSLA Companion, 2003, pp:116-117 [Conf]
  14. Jirí Adámek
    Addressing Unbounded Parallelism in Verification of Software Components. [Citation Graph (0, 0)][DBLP]
    SNPD, 2006, pp:49-56 [Conf]
  15. Jirí Adámek, Horst Herrlich, Jirí Rosický, Walter Tholen
    Weak Factorization Systems and Topological Functors. [Citation Graph (0, 0)][DBLP]
    Applied Categorical Structures, 2002, v:10, n:3, pp:237-249 [Journal]
  16. Jirí Adámek, Stefan Milius, Jiri Velebil
    Some Remarks on Finitary and Iterative Monads. [Citation Graph (0, 0)][DBLP]
    Applied Categorical Structures, 2003, v:11, n:6, pp:521-541 [Journal]
  17. Jirí Adámek, Stefan Milius, Jiri Velebil
    On coalgebra based on classes [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  18. Peter Aczel, Jirí Adámek, Jiri Velebil
    A Coalgebraic View of Infinite Trees and Iteration. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:44, n:1, pp:- [Journal]
  19. Jirí Adámek
    On a Description of Terminal Coalgebras and Iterative Theories. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:82, n:1, pp:- [Journal]
  20. Jirí Adámek, Stefan Milius
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:106, n:, pp:1-2 [Journal]
  21. Jirí Adámek, Stefan Milius, Jiri Velebil
    Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:65, n:1, pp:- [Journal]
  22. Jirí Adámek, Stefan Milius, Jiri Velebil
    On Rational Monads and Free Iterative Theories. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:69, n:, pp:- [Journal]
  23. Jirí Adámek, Stefan Milius, Jiri Velebil
    From Iterative Algebras to Iterative Theories (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2004, v:106, n:, pp:3-24 [Journal]
  24. Jirí Adámek, Stefan Milius, Jiri Velebil
    Iterative Algebras for a Base. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:122, n:, pp:147-170 [Journal]
  25. Jirí Adámek, Stefan Milius, Jiri Velebil
    Elgot Algebras: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:155, n:, pp:87-109 [Journal]
  26. Jirí Adámek, Hans-E. Porst
    From Varieties of Algebras to Covarieties of Coalgebras. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:44, n:1, pp:- [Journal]
  27. Jirí Adámek, Stefan Milius, Jiri Velebil
    How Iterative are Iterative Algebras? [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:164, n:1, pp:157-175 [Journal]
  28. Jirí Adámek
    Recursive Data Types in Algebraically omega-Complete Categories [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:118, n:2, pp:181-190 [Journal]
  29. Jirí Adámek, Stefan Milius
    Special Issue: Seventh Workshop on Coalgebraic Methods in Computer Science 2004. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:4, pp:435-436 [Journal]
  30. Jirí Adámek, Stefan Milius
    Terminal coalgebras and free iterative theories. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:7, pp:1139-1172 [Journal]
  31. Jirí Adámek, Václav Koubek
    Least Fixed Point of a Functor. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1979, v:19, n:2, pp:163-178 [Journal]
  32. Jirí Adámek, Evelyn Nelson, Jan Reiterman
    Tree Constructions of Free Continuous Algebras. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1982, v:24, n:1, pp:114-146 [Journal]
  33. Jirí Adámek, Evelyn Nelson, Jan Reiterman
    Continuous Algebras Revisited. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:3, pp:460-471 [Journal]
  34. Jirí Adámek, Peter T. Johnstone, Johann A. Makowsky, Jirí Rosický
    Finitary Sketches. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1997, v:62, n:3, pp:699-707 [Journal]
  35. Jirí Adámek
    Final Coalgebras are Ideal Completions of Initial Algebras. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2002, v:12, n:2, pp:217-242 [Journal]
  36. Jirí Adámek
    A Categorical Generalization of Scott Domains. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1997, v:7, n:5, pp:419-443 [Journal]
  37. Jirí Adámek, Stefan Milius, Jiri Velebil
    Free Iterative Theories: A Coalgebraic View. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2003, v:13, n:2, pp:259-320 [Journal]
  38. Jirí Adámek, Stefan Milius, Jiri Velebil
    A general final coalgebra theorem. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2005, v:15, n:3, pp:409-432 [Journal]
  39. Jirí Adámek, Hans-E. Porst
    On Varieties and Covarieties in a Category. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2003, v:13, n:2, pp:201-232 [Journal]
  40. Jirí Adámek, Jirí Rosický
    Finitary Sketches and Finitely Accessible Categories. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1995, v:5, n:3, pp:315-322 [Journal]
  41. Jirí Adámek
    On quasivarieties and varieties as categories. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2004, v:78, n:1-2, pp:7-33 [Journal]
  42. Jirí Adámek, Frantisek Plasil
    Component composition errors and update atomicity: static analysis. [Citation Graph (0, 0)][DBLP]
    Journal of Software Maintenance, 2005, v:17, n:5, pp:363-377 [Journal]
  43. Peter Aczel, Jirí Adámek, Stefan Milius, Jiri Velebil
    Infinite trees and completely iterative theories: a coalgebraic view. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:300, n:1-3, pp:1-45 [Journal]
  44. Jirí Adámek
    On final coalgebras of continuous functors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:294, n:1/2, pp:3-29 [Journal]
  45. Jirí Adámek, Martín Hötzel Escardó, Martin Hofmann
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:294, n:1/2, pp:1- [Journal]
  46. Jirí Adámek
    The intersection of algebra and coalgebra. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:366, n:1-2, pp:82-97 [Journal]
  47. Jirí Adámek, Michel Hébert, Jirí Rosický
    On abstract data types presented by multiequations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:275, n:1-2, pp:427-462 [Journal]
  48. Jirí Adámek, Václav Koubek
    On the Greatest Fixed Point of a Set Functor. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:150, n:1, pp:57-75 [Journal]
  49. Jirí Adámek, Stefan Milius, Jiri Velebil
    On coalgebra based on classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:316, n:1, pp:3-23 [Journal]
  50. Jirí Adámek, Evelyn Nelson
    Separately Continuous Algebras. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:27, n:, pp:225-231 [Journal]
  51. Jirí Adámek, Hans-E. Porst
    On tree coalgebras and coalgebra presentations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:311, n:1-3, pp:257-283 [Journal]
  52. Jirí Adámek, Jan Reiterman, Evelyn Nelson
    Continuous Semilattices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1986, v:43, n:, pp:293-313 [Journal]
  53. Jirí Adámek, Stefan Milius, Jiri Velebil
    What Are Iteration Theories? [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:240-252 [Conf]
  54. Jirí Adámek, Frantisek Plasil
    Erroneous architecture is a relative concept. [Citation Graph (0, 0)][DBLP]
    IASTED Conf. on Software Engineering and Applications, 2004, pp:715-720 [Conf]
  55. Jirí Adámek, Stefan Milius, Jiri Velebil
    Elgot Algebras [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  56. Jirí Adámek, Jirí Rosický
    On orthogonal subcategories of locally presentable categories. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:108, n:1-3, pp:133-137 [Journal]

  57. Semantics of Higher-Order Recursion Schemes. [Citation Graph (, )][DBLP]


  58. A Description of Iterative Reflections of Monads (Extended Abstract). [Citation Graph (, )][DBLP]


  59. Carmen: Software Component Model Checker. [Citation Graph (, )][DBLP]


  60. Checking Session-Oriented Interactions between Web Services. [Citation Graph (, )][DBLP]


  61. Constructions of Solid Hulls. [Citation Graph (, )][DBLP]


  62. Morita Equivalence of Sketches. [Citation Graph (, )][DBLP]


  63. The Orthogonal Subcategory Problem and the Small Object Argument. [Citation Graph (, )][DBLP]


  64. Preface. [Citation Graph (, )][DBLP]


  65. Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract). [Citation Graph (, )][DBLP]


  66. Automated Construction of Reasonable Environment for Java Components. [Citation Graph (, )][DBLP]


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