default search action

combined dblp search
author search
venue search
publication search

ask others

Theoretical Computer Science, Volume 948

> 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 948, February 2023

Section A: Algorithms, automata, complexity and games

- view
  authority control:
- export record
  dblp key:
  - journals/tcs/Kamiyama23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Kamiyama23
Naoyuki Kamiyama:
Pareto efficient matchings with pairwise preferences. 113707
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/HalldorssonN23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/HalldorssonN23
Magnús M. Halldórsson, Alexandre Nolin:
Superfast coloring in CONGEST via efficient color sampling. 113711
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/RabinowitzR23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/RabinowitzR23
Assaf Rabinowitz, Dror Rawitz:
Overflow management with self-eliminations. 113732
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/AlistarhER23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/AlistarhER23
Dan Alistarh, Faith Ellen, Joel Rybicki:
Wait-free approximate agreement on graphs. 113733
- view
  authority control:
- export record
  dblp key:
  - journals/tcs/Pitt23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Pitt23
Lenny Pitt:
Turing Tumble is Turing-Complete. 113734

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.