default search action

combined dblp search
author search
venue search
publication search

ask others

Theoretical Computer Science, Volume 762

> Home > Journals > Theoretical Computer Science

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Volume 762, March 2019

- view
  authority control:
- export record
  dblp key:
  - journals/tcs/HeLS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/HeLS19
Kun He, Qian Li, Xiaoming Sun:
A tighter relation between sensitivity complexity and certificate complexity. 1-12
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/Sabeti19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Sabeti19
Rostam Sabeti:
Polynomial expressions for non-binomial structures. 13-24
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/KawachiOU19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/KawachiOU19
Akinori Kawachi, Mitsunori Ogihara, Kei Uchizawa:
Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs. 25-40
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/NavarroP19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/NavarroP19
Gonzalo Navarro, Nicola Prezza:
Universal compressed text indexing. 41-50
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/KuceraSV19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/KuceraSV19
Petr Kucera, Petr Savický, Vojtech Vorel:
A lower bound on CNF encodings of the at-most-one constraint. 51-73

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.