An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines (Englisch)
Freier Zugriff
- Neue Suche nach: Lu, Pinyan
- Neue Suche nach: Yu, Changyuan
- Neue Suche nach: Lu, Pinyan
- Neue Suche nach: Yu, Changyuan
- Neue Suche nach: Albers, Susanne
- Neue Suche nach: Weil, Pascal
In:
LIPIcs, Volume 1, STACS 2008
: 25th International Symposium on Theoretical Aspects of Computer Science
;
1
;
527-538
;
2008
-
ISBN:
-
ISSN:
- Aufsatz (Konferenz) / Elektronische Ressource
-
Titel:An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines
-
Beteiligte:Lu, Pinyan ( Autor:in ) / Yu, Changyuan ( Autor:in ) / Albers, Susanne ( Herausgeber:in ) / Weil, Pascal ( Herausgeber:in )
-
Erschienen in:LIPIcs, Volume 1, STACS 2008 : 25th International Symposium on Theoretical Aspects of Computer Science ; 1 ; 527-538
-
Verlag:
- Neue Suche nach: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Erscheinungsdatum:06.02.2008
-
Format / Umfang:12 pages , 176929 byte
-
Anmerkungen:LIPIcs, Vol. 1, 25th International Symposium on Theoretical Aspects of Computer Science, pages 527-538
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Lizenzbestimmungen:
-
Datenquelle:
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Preface -- 25th International Symposium on Theoretical Aspects of Computer ScienceAlbers, Susanne / Weil, Pascal et al. | 2008
- 2
-
Understanding Maximal Repetitions in StringsCrochemore, Maxime / Ilie, Lucian et al. | 2008
- 3
-
A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract)Schwentick, Thomas et al. | 2008
- 4
-
Equilibria, Fixed Points, and Complexity ClassesYannakakis, Mihalis et al. | 2008
- 5
-
Pushdown CompressionAlbert, Pilar / Mayordomo, Elvira / Moser, Philip / Perifel, Sylvain et al. | 2008
- 6
-
Quantum search with variable timesAmbainis, Andris et al. | 2008
- 7
-
Structural aspects of tilingsBallier, Alexis / Durand, Bruno / Jeandal, Emmanuel et al. | 2008
- 8
-
Limit complexities revisitedBienvenu, Laurent / Muchnik, Andrej / Shen, Alexander / Veraschagin, Nikolay et al. | 2008
- 9
-
Trimmed Moebius Inversion and Graphs of Bounded DegreeBjörklund, Andreas / Husfeldt, Thore / Kaski, Petteri / Koivisto, Mikko et al. | 2008
- 10
-
On the Complexity of the Interlace PolynomialBläser, Markus / Hoffmann, Christian et al. | 2008
- 11
-
Minimizing Flow Time in the Wireless Gathering ProblemBonifaci, Vincenzo / Korteweg, Peter / Marchetti-Spaccamela, Alberto / Stougie, Leen et al. | 2008
- 12
-
On Termination for Faulty Channel MachinesBouyer, Patricia / Markey, Nicolas / Ouaknine, Joël / Schnoebelen, Philippe / Worrell, James et al. | 2008
- 13
-
Stackelberg Network Pricing GamesBriest, Patrick / Hoefer, Martin / Krysta, Piotr et al. | 2008
- 14
-
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower BoundBrody, Joshua / Chakrabarti, Amit et al. | 2008
- 15
-
Finding Irrefutable Certificates for S_2^p via Arthur and MerlinChakaravarthy, Venkatesan T. / Roy, Sambuddha et al. | 2008
- 16
-
Quantifying Homology ClassesChen, Chao / Freedman, Daniel et al. | 2008
- 17
-
Shortest Vertex-Disjoint Two-Face Paths in Planar GraphsColin de Verdiére, Éric / Schrijver, Alexander et al. | 2008
- 18
-
Geodesic Fréchet Distance Inside a Simple PolygonWenk, Carola / Cook, Atlas F. et al. | 2008
- 19
-
Improved Algorithms for the Range Next Value Problem and ApplicationsIliopoulos, Costas S. / Crochemore, Maxime / Kubica, Marcin / Rahman, M. Sohel / Walen, Tomasz et al. | 2008
- 20
-
Connecting Polygonizations via Stretches and TwangsDamian, Mirela / Flatland, Robin / O'Rourke, Joseph / Ramaswani, Suneeta et al. | 2008
- 21
-
Deterministically Isolating a Perfect Matching in Bipartite Planar GraphsDatta, Samir / Kulkarni, Raghav / Roy, Sambuddha et al. | 2008
- 22
-
Tight Bounds for Blind Search on the IntegersDietzfelbinger, Martin / Rowe, Jonathan E. / Wegener, Ingo / Woelfel, Philipp et al. | 2008
- 23
-
Discrete Jordan Curve Theorem: A proof formalized in Coq with hypermapsDufourd, Jean-Francois et al. | 2008
- 24
-
Trimming of Graphs, with Application to Point LabelingErlebach, Thomas / Hagerup, Torben / Jansen, Klaus / Minzlaff, Moritz / Wolff, Alexander et al. | 2008
- 25
-
Computing Minimum Spanning Trees with UncertaintyHoffmann, Michael / Erlebach, Thomas / Krizanc, Danny / Mihal'ák, Matús / Raman, Rajeev et al. | 2008
- 26
-
Convergence Thresholds of Newton's Method for Monotone Polynomial EquationsEsparza, Javier / Kiefer, Stefan / Luttenberger, Michael et al. | 2008
- 27
-
Model Checking Games for the Quantitative µ-CalculusFischer, Diana / Grädel, Erich / Kaiser, Lukasz et al. | 2008
- 28
-
Order-Invariant MSO is Stronger than Counting MSO in the FiniteGanzow, Tobias / Rubin, Sasha et al. | 2008
- 29
-
Succinctness of the Complement and Intersection of Regular ExpressionsGelade, Wouter / Neven, Frank et al. | 2008
- 30
-
Efficient Algorithms for Membership in Boolean Hierarchies of Regular LanguagesGlasser, Christian / Schmitz, Heinz / Selivanov, Victor et al. | 2008
- 31
-
On the Complexity of Elementary Modal LogicsHemaspaandra, Edith / Schnoor, Henning et al. | 2008
- 32
-
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible SupertreesHoang, Viet Tung / Sung, Wing-Kin et al. | 2008
- 33
-
Complexity of solutions of equations over sets of natural numbersOkhotin, Alexander / Jez, Artur et al. | 2008
- 34
-
Cardinality and counting quantifiers on omega-automatic structuresKaiser, Lukasz / Rubin, Sasha / Bárány, Vince et al. | 2008
- 35
-
On the Induced Matching ProblemKanj, Iyad A. / Pelsmajer, Michael J. / Xia, Ge / Schaefer, Marcus et al. | 2008
- 36
-
On Geometric Spanners of Euclidean and Unit Disk GraphsPerkovic, Ljubomir / Kanj, Iyad A. et al. | 2008
- 37
-
The Frobenius Problem in a Free MonoidKao, Jui-Yi / Shallit, Jeffrey / Xu, Zhi et al. | 2008
- 38
-
Space Hierarchy Results for Randomized ModelsKinne, Jeff / van Melkebeek, Dieter et al. | 2008
- 39
-
Ehrenfeucht-Fraissé Goes Automatic for Real AdditionKlaedtke, Felix et al. | 2008
- 40
-
New Combinatorial Complete One-Way FunctionsKojevnikov, Arist / Nikolenko, Sergey I. et al. | 2008
- 41
-
Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logicKuske, Dietrich et al. | 2008
- 42
-
Geometric Set Cover and Hitting Sets for Polytopes in R³Lauen, Sören et al. | 2008
- 43
-
A Theory for Valiant's Matchcircuits (Extended Abstract)Li, Angsheng / Xia, Mingji et al. | 2008
- 44
-
Rent, Lease or Buy: Randomized Algorithms for Multislope Ski RentalLotker, Zvi / Patt-Shamir, Boaz / Rawitz, Dror et al. | 2008
- 45
-
Lower bounds for adaptive linearity testsLovett, Shachar et al. | 2008
- 47
-
An Improved Randomized Truthful Mechanism for Scheduling Unrelated MachinesLu, Pinyan / Yu, Changyuan et al. | 2008
- 46
-
Lagrangian Relaxation and Partial Cover (Extended Abstract)Mestre, Julián et al. | 2008
- 48
-
On Dynamic Breadth-First Search in External-MemoryMeyer, Ulrich et al. | 2008
- 49
-
Analytic aspects of the shuffle productMishna, Marni / Zabrocki, Mike et al. | 2008
- 50
-
Weak index versus Borel rankMurlak, Filip et al. | 2008
- 51
-
A Mahler's theorem for functions from words to integersPin, Jean-Eric / Silva, Pedro V. et al. | 2008
- 52
-
Distinguishing Short Quantum ComputationsRosgen, Bill et al. | 2008
- 53
-
Factoring Polynomials over Finite Fields using Balance TestSaha, Chandan et al. | 2008
- 54
-
On the decomposition of k-valued rational relationsSakarovitch, Jacques / de Souza, Rodrigo et al. | 2008
- 55
-
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous LogspaceThierauf, Thomas / Wagner, Fabian et al. | 2008
- 56
-
Efficient Minimization of DFAs with Partial TransitionValmari, Antti / Lehtinen, Petri et al. | 2008
- 57
-
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Setvan Rooij, Johan M. M. / Bodlaender, Hans L. et al. | 2008
- 58
-
Weighted Matching in the Semi-Streaming ModelZelke, Mariano et al. | 2008