The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
2001, volume: 265, number: 1-2

  1. Olivier Dubois, Rémi Monasson, Bart Selman, Riccardo Zecchina
    Editorial. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:265, n:1-2, pp:1- [Journal]
  2. Olivier C. Martin, Rémi Monasson, Riccardo Zecchina
    Statistical mechanics methods and phase transitions in optimization problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:265, n:1-2, pp:3-67 [Journal]
  3. Michel Talagrand
    Rigorous results for mean field models for spin glasses. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:265, n:1-2, pp:69-77 [Journal]
  4. Stephan Mertens
    A physicist's approach to number partitioning. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:265, n:1-2, pp:79-108 [Journal]
  5. Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc
    Rigorous results for random (2+p)-SAT. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:265, n:1-2, pp:109-129 [Journal]
  6. Wenceslas Fernandez de la Vega
    Random 2-SAT: results and problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:265, n:1-2, pp:131-146 [Journal]
  7. John V. Franco
    Results related to threshold phenomena research in satisfiability: lower bounds. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:265, n:1-2, pp:147-157 [Journal]
  8. Dimitris Achlioptas
    Lower bounds for random 3-SAT via differential equations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:265, n:1-2, pp:159-185 [Journal]
  9. Olivier Dubois
    Upper bounds on the satisfiability threshold. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:265, n:1-2, pp:187-197 [Journal]
  10. Alexander K. Hartmann, Martin Weigt
    Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:265, n:1-2, pp:199-225 [Journal]
  11. Joseph C. Culberson, Ian P. Gent
    Frozen development in graph coloring. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:265, n:1-2, pp:227-264 [Journal]
  12. Barbara M. Smith
    Constructing an asymptotic phase transition in random binary constraint satisfaction problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:265, n:1-2, pp:265-283 [Journal]
  13. Andreas Engel
    Complexity of learning in artificial neural networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:265, n:1-2, pp:285-306 [Journal]
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