IEEE Symposium on Logic in Computer Science

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Authors on this page:

• Rasmus Ibsen-Jensen
• Pawel Idziak
• Pawel M. Idziak
• Danko Ilik
• Neil Immerman
• Russell Impagliazzo
• Anna Ingólfsdóttir
• Benedetto Intrigila
• Hajime Ishihara
• Takayasu Ito

Rasmus Ibsen-Jensen

• Paper: John Fearnley Rasmus Ibsen-Jensen Rahul Savani
  One-Clock Priced Timed Games are PSPACE-hard (LICS 2020) More Information...
• Paper: Sougata Bose Rasmus Ibsen-Jensen Patrick Totzke
  Bounded-Memory Strategies in Partial-Information Games (LICS 2024) More Information...

Pawel Idziak

• Paper: Pawel Idziak Petar Markovic Ralph McKenzie Matthew Valeriote Ross Willard
  Tractability and learnability arising from algebras with few subpowers (LICS 2007) More Information...

Pawel M. Idziak

• Paper: Pawel M. Idziak Jacek Krzaczkowski
  Satisfiability in multi-valued circuits (LICS 2018) More Information...
• Paper: Pawel M. Idziak Piotr Kawalek Jacek Krzaczkowski
  Intermediate problems in modular circuits satisfiability (LICS 2020) More Information...
• Paper: Pawel M. Idziak Piotr Kawalek Jacek Krzaczkowski
  Complexity of Modular Circuits (LICS 2022) More Information...

Danko Ilik

• Paper: Danko Ilik
  Axioms and decidability for type isomorphism in the presence of sums (LICS 2014) More Information...

Neil Immerman

• Paper: Neil Immerman Dexter C. Kozen
  Definability with Bounded Number of Bound Variables (LICS 1987) More Information...
• Paper: J. Antonio Medina Neil Immerman
  A syntactic characterization of NP-completeness (LICS 1994) More Information...
• Paper: Yuri Gurevich Neil Immerman Saharon Shelah
  McColm's conjecture [positive elementary inductions] (LICS 1994) More Information...
• Paper: Kousha Etessami Neil Immerman
  Tree Canonization and Transtive Closure (LICS 1995) More Information...
• Paper: J. Antonio Medina Neil Immerman
  A generalization of Fagin's theorem (LICS 1996) More Information...
• Paper: David A. Mix Barrington Neil Immerman Clemens Lautemann Nicole Schweikardt Denis Thérien
  The Crane Beach Conjecture (LICS 2001) More Information...
• Paper: Micah Adler Neil Immerman
  An n! Lower Bound on Formula Size (LICS 2001) More Information...
• Paper: William Hesse Neil Immerman
  Complete problems for Dynamic Complexity Classes (LICS 2002) More Information...
• Paper: Rajeev Alur Marcelo Arenas Pablo Barceló Kousha Etessami Neil Immerman Leonid Libkin
  First-Order and Temporal Logics for Nested Words (LICS 2007) More Information...

Russell Impagliazzo

• Paper: Russell Impagliazzo Toniann Pitassi Alasdair Urquhart
  Upper and lower bounds for tree-like cutting planes proofs (LICS 1994) More Information...
• Paper: Russell Impagliazzo Sasank Mouli Toniann Pitassi
  The Surprising Power of Constant Depth Algebraic Proofs (LICS 2020) More Information...

Anna Ingólfsdóttir

• Invited Paper: Luca Aceto Elli Anastasiadi Valentina Castiglioni Anna Ingólfsdóttir Bas Luttik
  In search of lost time: Axiomatising parallel composition in process algebras (LICS 2021) More Information...

Benedetto Intrigila

• Paper: Benedetto Intrigila Richard Statman
  The Omega Rule is II_2^0-Hard in the λβ-Calculus (LICS 2004) More Information...

Hajime Ishihara

• Paper: Hajime Ishihara Bakhadyr Khoussainov Sasha Rubin
  Some Results on Automatic Structures (LICS 2002) More Information...

Takayasu Ito

• Paper: Max I. Kanovich Takayasu Ito
  Temporal Linear Logic Specifications for Concurrent Processes (LICS 1997) More Information...