The SCEAS System
Navigation Menu

Search the dblp DataBase


László Zádori: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ingo Wegener, Laszlo Zádori
    A Note on the Relations Between Critical and Sensitive Complexity. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1989, v:25, n:8/9, pp:417-421 [Journal]
  2. Benoit Larose, László Zádori
    Taylor Terms, Constraint Satisfaction and the Complexity of Polynomial Equations over Finite Algebras. [Citation Graph (0, 0)][DBLP]
    IJAC, 2006, v:16, n:3, pp:563-582 [Journal]
  3. Benoit Larose, Cynthia Loten, László Zádori
    A polynomial-time algorithm for near-unanimity graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:55, n:2, pp:177-191 [Journal]
  4. Csaba Szabó, László Zádori
    Idempotent Totally Symmetric Operations on Finite Posets. [Citation Graph (0, 0)][DBLP]
    Order, 2001, v:18, n:1, pp:39-47 [Journal]
  5. Benoit Larose, László Zádori
    The Complexity of the Extendibility Problem for Finite Posets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2003, v:17, n:1, pp:114-121 [Journal]
  6. Benoit Larose, László Zádori
    Algebraic properties and dismantlability of finite posets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:163, n:1-3, pp:89-99 [Journal]

  7. A combinatorial constraint satisfaction problem dichotomy classification conjecture. [Citation Graph (, )][DBLP]

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