default search action

combined dblp search
author search
venue search
publication search

ask others

Theoretical Computer Science, Volume 740

> 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 740, September 2018

- view
  authority control:
- export record
  dblp key:
  - journals/tcs/KostolanyiM18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/KostolanyiM18
Peter Kostolányi, Filip Misún:
Alternating weighted automata over commutative semirings. 1-27
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/MittelbachV18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/MittelbachV18
Arno Mittelbach, Daniele Venturi:
Fiat-Shamir for highly sound protocols is instantiable. 28-62
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/Honkala18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Honkala18
Juha Honkala:
Equality sets of binary D0L sequences. 63-67
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/LiCS18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/LiCS18
Wenhua Li, Xing Chai, Yali Song:
A best possible on-line algorithm for scheduling on uniform parallel-batch machines. 68-75
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/KonstantinidisN18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/KonstantinidisN18
Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, Charis Papadopoulos:
Strong triadic closure in cographs and graphs of low maximum degree. 76-84

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.