default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChicago Journal of Theoretical Computer Science, 2011
Volume 2011, 2011
- Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee, Hing-Fung Ting, Pan Zhang:
Non-clairvoyant Scheduling for Weighted Flow Time and Energy on Speed Bounded Processors. - Ling-Ju Hung, Ton Kloks:
k-Cographs are Kruskalian. - Kazuyuki Amano:
On Directional vs. General Randomized Decision Tree Complexity for Read-Once Formulas. - Vida Dujmovic, Joachim Gudmundsson, Pat Morin, Thomas Wolle:
Notes on Large Angle Crossing Graphs. - Joshua R. Davis, David Liben-Nowell, Alexa Sharp, Tom Wexler:
Mediated Equilibria in Load-Balanced Games. - Scott Aaronson, François Le Gall, Alexander Russell, Seiichiro Tani:
The One-Way Communication Complexity of Subgroup Membership.
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-01-30 20:21 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:
