some image logo

HOME

SEARCH

CURRENT ISSUE

REGULAR ISSUES

SPECIAL ISSUES

SURVEY ARTICLES

AUTHORS

ABOUT

SERVICE

LOGIN

FAQ

SUPPORT

CONTACT

RECENTLY PUBLISHED

Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis

  
Assalé Adjé, Stéphane Gaubert and Eric Goubault

Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus

  
Naoki Kobayashi and C.-H. Luke Ong

Timed Parity Games: Complexity and Robustness

  
Krishnendu Chatterjee, Thomas A Henzinger and Vinayak S Prabhu

A note on the expressive power of linear orders

  
Thomas Schwentick and Nicole Schweikardt

The Complexity of Rooted Phylogeny Problems

  
Manuel Bodirsky and Jens K. Mueller

Proof-irrelevant model of CC with predicative induction and judgmental equality

  
Gyesik Lee and Benjamin Werner




Logical Methods in Computer Science is an open-access journal, covered by Thompson ISI (citation index 0.864 ), SCOPUS, DBLP, Mathematical Reviews and Zentralblatt. All journal content is licensed under a Creative Commons license.