Opin vísindi

Browsing by Subject "Theoretical Computer Science"

Browsing by Subject "Theoretical Computer Science"

Sort by: Order: Results:

  • Icon
    Improved distributed algorithms for coloring interval graphs with application to multicoloring trees 
    Halldórsson, Magnús M.; Konrad, Christian (Elsevier BV, 2020-04)
    We give a distributed (1+eps)-approximation algorithm for the minimum vertex coloring problem on interval graphs, which runs in the LOCAL model and operates in O((1/eps) log* n) rounds. If nodes are aware of their interval representations, then the ...
  • Icon
    Leader election in SINR model with arbitrary power control 
    Halldórsson, Magnús M.; Holzer, Stephan; Markatou, Evangelia Anna; Lynch, Nancy (Elsevier BV, 2020-04)
    We consider the Leader Election Problem in the Signal-to-Interference-plusNoise-Ratio (SINR) model where nodes can adjust their transmission power. We show that in this setting it is possible to elect a leader in two communication rounds, with high ...
  • Icon
    Plotkin's call-by-value λ-calculus as a modal calculus 
    Espírito Santo, José; Pinto, Luís; Uustalu, Tarmo (Elsevier BV, 2022-06)
    In the authors' previous analysis of the calling paradigms call-by-name and call-by-value through Girard's and Gödel's embeddings into the S4 modal logic, an asymmetry remains: the two paradigms are unified by the call-by-box paradigm of the modal ...