default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 569
Volume 569, March 2015
- Walter O. Krawec:
n-Player impartial combinatorial games with random players. 1-12 - Liron Levin, Dariusz R. Kowalski, Michael Segal
:
Message and time efficient multi-broadcast schemes. 13-23 - Prosenjit Bose, Jean-Lou De Carufel, Stephane Durocher:
Searching on a line: A complete characterization of the optimal solution. 24-42 - Piotr Skowron, Lan Yu, Piotr Faliszewski, Edith Elkind:
The complexity of fully proportional representation for single-crossing electorates. 43-57 - Yu Yu, Xiangxue Li, Jian Weng:
Pseudorandom generators from regular one-way functions: New constructions with improved parameters. 58-69
- Nhat X. Lam, Tien Tran, Min Kyung An, Dung T. Huynh:
A note on the complexity of minimum latency data aggregation scheduling with uniform power in physical interference model. 70-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.
last updated on 2025-12-08 10:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
