Výsledky vyhledávání - "Yvonne Anne Oswald"

Tight Bounds for Delay-Sensitive Aggregation

Autor: Roger Wattenhofer, Yvonne Anne Oswald, Stefan Schmid

Publikováno v: Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2010, 12 (1), pp.38-58
PODC

Distributed Computing and Networking
This article studies the fundamental trade-off between delay and communication cost in networks. We consider an online optimization problem where nodes are organized in a tree topology. The nodes seek to mini

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0daf792206611b7eafb1ef13c24ba17e
https://doi.org/10.46298/dmtcs.489

Zobrazit plný text záznamu

Word of Mouth: Rumor Dissemination in Social Networks

Autor: Jan Kostka, Roger Wattenhofer, Yvonne Anne Oswald

Publikováno v: Structural Information and Communication Complexity ISBN: 9783540693260
SIROCCO

In this paper we examine the diffusion of competing rumors in social networks. Two players select a disjoint subset of nodes as initiators of the rumor propagation, seeking to maximize the number of persuaded nodes. We use concepts of game theory and

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::5e8c8ed46a94518fd6107982636499d9
https://doi.org/10.1007/978-3-540-69355-0_16

Zobrazit plný text záznamu

On the windfall of friendship

Autor: Yvonne Anne Oswald, Dominic Meier, Stefan Schmid, Roger Wattenhofer

Publikováno v: EC

This paper studies a virus inoculation game on social networks. A framework is presented which allows the measuring of the windfall of friendship, i.e., how much players benefit if they care about the welfare of their direct neighbors in the social n

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::5b6bcfd82ecdc1bf9c0a1d33a7f96a47
https://doi.org/10.1145/1386790.1386836

Zobrazit plný text záznamu

What can be approximated locally?

Autor: Christoph Lenzen, Yvonne Anne Oswald, Roger Wattenhofer

Publikováno v: SPAA

Whether local algorithms can compute constant approximations of NP-hard problems is of both practical and theoretical interest. So far, no algorithms achieving this goal are known, as either the approximation ratio or the running time exceed O(1), or

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::27edc9161dad6d804a8f98616466c84b
https://doi.org/10.1145/1378533.1378540

Zobrazit plný text záznamu

Manipulation in Games

Autor: Raphael Eidenbenz, Roger Wattenhofer, Yvonne Anne Oswald, Stefan Schmid

Publikováno v: Algorithms and Computation ISBN: 9783540771180
ISAAC

This paper studies to which extent the social welfare of a game can be influenced by an interested third party within economic reason, i.e., by taking the implementation cost into account. Besides considering classic, benevolent mechanism designers,

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::8f1a04581806eeaf5c2575a5d78f435b
https://doi.org/10.1007/978-3-540-77120-3_33

Zobrazit plný text záznamu

Complexity in geometric SINR

Autor: Yvonne Anne Oswald, Roger Wattenhofer, Olga Goussevskaia

Publikováno v: MobiHoc

In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We present the first NP-completeness proofs in such a model. In particular,

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::074ded198fa7ac87a65c3658ce91c860
https://doi.org/10.1145/1288107.1288122

Zobrazit plný text záznamu

Mechanism Design by Creditability

Autor: Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid, Roger Wattenhofer

Publikováno v: Combinatorial Optimization and Applications ISBN: 9783540735557
COCOA

This paper attends to the problem of a mechanism designer seeking to influence the outcome of a strategic game based on her creditability. The mechanism designer offers additional payments to the players depending on their mutual choice of strategies

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::b541b25fa26114ca029107c560abe4a0
https://doi.org/10.1007/978-3-540-73556-4_24

Zobrazit plný text záznamu

Luby-Rackoff Ciphers from Weak Round Functions?

Autor: Johan Sjödin, Krzysztof Pietrzak, Ueli Maurer, Yvonne Anne Oswald

Publikováno v: Advances in Cryptology-EUROCRYPT 2006 ISBN: 9783540345466
EUROCRYPT

The Feistel-network is a popular structure underlying many block-ciphers where the cipher is constructed from many simpler rounds, each defined by some function which is derived from the secret key. Luby and Rackoff showed that the three-round Feiste

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::2946d91ba89cbf2513a682afa8ac2cc9
https://doi.org/10.1007/11761679_24

Zobrazit plný text záznamu

Optimization of the MOVA Undeniable Signature Scheme

Autor: Yvonne Anne Oswald, Jean Monnerat, Serge Vaudenay

Publikováno v: Progress in Cryptology – Mycrypt 2005 ISBN: 9783540289388
Mycrypt

This article presents optimization results on the MOVA undeniable signature scheme presented last year by Monnerat and Vaudenay at PKC ’04 as well as its generalization proposed at Asiacrypt ’04 which is based on a secret group homomorphism. The

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::959d2e470de35f8484658edfb6a44f3a
https://infoscience.epfl.ch/record/99487

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání