Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems (English)
- New search for: Katriel, Irit
- New search for: Kenyon-Mathieu, Claire
- New search for: Upfal, Eli
- New search for: Katriel, Irit
- New search for: Kenyon-Mathieu, Claire
- New search for: Upfal, Eli
In:
Automata, Languages and Programming
6
;
171-182
;
2007
- Article/Chapter (Book) / Electronic Resource
-
Title:Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
-
Contributors:
-
Published in:Automata, Languages and Programming , 6 ; 171-182Lecture Notes in Computer Science ; 4596, 6 ; 171-182
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin, Heidelberg
-
Publication date:2007-01-01
-
Size:12 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Ushering in a New Era of Algorithm DesignChazelle, Bernard et al. | 2007
- 2
-
A “proof-reading” of Some Issues in CryptographyDamgård, Ivan et al. | 2007
- 12
-
Credentials-Based Authorization: Evaluation and ImplementationSchneider, Fred B. et al. | 2007
- 15
-
Subexponential Parameterized AlgorithmsDorn, Frederic / Fomin, Fedor V. / Thilikos, Dimitrios M. et al. | 2007
- 28
-
Competitive Algorithms for Due Date SchedulingBansal, Nikhil / Chan, Ho-Leung / Pruhs, Kirk et al. | 2007
- 40
-
Mechanism Design for Fractional Scheduling on Unrelated MachinesChristodoulou, George / Koutsoupias, Elias / Kovács, Annamária et al. | 2007
- 53
-
Estimating Sum by Weighted SamplingMotwani, Rajeev / Panigrahy, Rina / Xu, Ying et al. | 2007
- 65
-
Sampling Methods for Shortest Vectors, Closest Vectors and Successive MinimaBlömer, Johannes / Naewe, Stefanie et al. | 2007
- 78
-
Low Distortion SpannersPettie, Seth et al. | 2007
- 90
-
Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar GraphsBerger, André / Grigni, Michelangelo et al. | 2007
- 102
-
Labeling Schemes for Vertex ConnectivityKorman, Amos et al. | 2007
- 110
-
Unbounded-Error One-Way Classical and Quantum Communication ComplexityIwama, Kazuo / Nishimura, Harumichi / Raymond, Rudy / Yamashita, Shigeru et al. | 2007
- 122
-
A Lower Bound on Entanglement-Assisted Quantum Communication ComplexityMontanaro, Ashley / Winter, Andreas et al. | 2007
- 134
-
Separating Deterministic from Nondeterministic NOF Multiparty Communication ComplexityBeame, Paul / David, Matei / Pitassi, Toniann / Woelfel, Philipp et al. | 2007
- 146
-
An Optimal Decomposition Algorithm for Tree Edit DistanceDemaine, Erik D. / Mozes, Shay / Rossman, Benjamin / Weimann, Oren et al. | 2007
- 158
-
On Commutativity Based Edge Lean SearchBošnački, Dragan / Elkind, Edith / Genest, Blaise / Peled, Doron et al. | 2007
- 171
-
Commitment Under Uncertainty: Two-Stage Stochastic Matching ProblemsKatriel, Irit / Kenyon-Mathieu, Claire / Upfal, Eli et al. | 2007
- 183
-
On the Complexity of Hard-Core Set ConstructionsLu, Chi-Jen / Tsai, Shi-Chun / Wu, Hsin-Lung et al. | 2007
- 195
-
Approximation by DNF: Examples and CounterexamplesO’Donnell, Ryan / Wimmer, Karl et al. | 2007
- 207
-
Exotic Quantifiers, Complexity Classes, and Complete ProblemsBürgisser, Peter / Cucker, Felipe et al. | 2007
- 219
-
Online Conflict-Free Colorings for HypergraphsBar-Noy, Amotz / Cheilaris, Panagiotis / Olonetsky, Svetlana / Smorodinsky, Shakhar et al. | 2007
- 231
-
Distributed Computing with Advice: Information Sensitivity of Graph ColoringFraigniaud, Pierre / Gavoille, Cyril / Ilcinkas, David / Pelc, Andrzej et al. | 2007
- 243
-
Private Multiparty Sampling and Approximation of Vector CombinationsIshai, Yuval / Malkin, Tal / Strauss, Martin J. / Wright, Rebecca N. et al. | 2007
- 255
-
Constant-Round Private Database QueriesDedic, Nenad / Mohassel, Payman et al. | 2007
- 267
-
Universal Algebra and Hardness Results for Constraint Satisfaction ProblemsLarose, Benoît / Tesson, Pascal et al. | 2007
- 279
-
On the Power of k-ConsistencyAtserias, Albert / Bulatov, Andrei / Dalmau, Victor et al. | 2007
- 291
-
Complexity of Propositional Proofs Under a PromiseDershowitz, Nachum / Tzameret, Iddo et al. | 2007
- 303
-
Deterministic History-Independent Strategies for Storing Information on Write-Once MemoriesMoran, Tal / Naor, Moni / Segev, Gil et al. | 2007
- 316
-
Trading Static for Adaptive Security in Universally Composable Zero-KnowledgeKiayias, Aggelos / Zhou, Hong-Sheng et al. | 2007
- 328
-
A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)Kapron, Bruce / Malka, Lior / Srinivasan, Venkatesh et al. | 2007
- 340
-
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored GraphsFellows, Michael R. / Fertin, Guillaume / Hermelin, Danny / Vialette, Stéphane et al. | 2007
- 352
-
Parameterized Algorithms for Directed Maximum Leaf ProblemsAlon, Noga / Fomin, Fedor V. / Gutin, Gregory / Krivelevich, Michael / Saurabh, Saket et al. | 2007
- 363
-
Parameterized Approximability of the Disjoint Cycle ProblemGrohe, Martin / Grüber, Magdalena et al. | 2007
- 375
-
Linear Problem Kernels for NP-Hard Problems on Planar GraphsGuo, Jiong / Niedermeier, Rolf et al. | 2007
- 387
-
Private Locally Decodable CodesOstrovsky, Rafail / Pandey, Omkant / Sahai, Amit et al. | 2007
- 399
-
Hash Functions in the Dedicated-Key Setting: Design Choices and MPP TransformsBellare, Mihir / Ristenpart, Thomas et al. | 2007
- 411
-
Unrestricted Aggregate SignaturesBellare, Mihir / Namprempre, Chanathip / Neven, Gregory et al. | 2007
- 423
-
Ring Signatures of Sub-linear Size Without Random OraclesChandran, Nishanth / Groth, Jens / Sahai, Amit et al. | 2007
- 435
-
Balanced Families of Perfect Hash Functions and Their ApplicationsAlon, Noga / Gutner, Shai et al. | 2007
- 447
-
An Exponential Improvement on the MST Heuristic for Minimum Energy Broadcasting in Ad Hoc Wireless NetworksCaragiannis, Ioannis / Flammini, Michele / Moscardelli, Luca et al. | 2007
- 459
-
Modular Algorithms for Heterogeneous Modal LogicsSchröder, Lutz / Pattinson, Dirk et al. | 2007
- 472
-
Co-Logic Programming: Extending Logic Programming with CoinductionSimon, Luke / Bansal, Ajay / Mallya, Ajay / Gupta, Gopal et al. | 2007
- 484
-
Offline/Online MixingAdida, Ben / Wikström, Douglas et al. | 2007
- 496
-
Fully Collusion Resistant Black-Box Traitor Revocable Broadcast Encryption with Short Private KeysFurukawa, Jun / Attrapadung, Nuttapong et al. | 2007
- 509
-
Succinct Ordinal Trees Based on Tree CoveringHe, Meng / Munro, J. Ian / Rao, S. Srinivasa et al. | 2007
- 521
-
A Framework for Dynamizing Succinct Data StructuresGupta, Ankur / Hon, Wing-Kai / Shah, Rahul / Vitter, Jeffrey Scott et al. | 2007
- 533
-
In-Place Suffix SortingFranceschini, Gianni / Muthukrishnan, S. et al. | 2007
- 546
-
Maximal Infinite-Valued Constraint LanguagesBodirsky, Manuel / Chen, Hubie / Kára, Jan / Oertzen, Timo et al. | 2007
- 558
-
Affine Systems of Equations and Counting Infinitary LogicAtserias, Albert / Bulatov, Andrei / Dawar, Anuj et al. | 2007
- 571
-
Boundedness of Monadic FO over Acyclic StructuresKreutzer, Stephan / Otto, Martin / Schweikardt, Nicole et al. | 2007
- 583
-
Strong Price of Anarchy for Machine Load BalancingFiat, Amos / Kaplan, Haim / Levy, Meital / Olonetsky, Svetlana et al. | 2007
- 595
-
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix GamesKontogiannis, Spyros C. / Spirakis, Paul G. et al. | 2007
- 607
-
Equational Systems and Free Constructions (Extended Abstract)Fiore, Marcelo / Hur, Chung-Kil et al. | 2007
- 619
-
Categorical Views on Computations on Trees (Extended Abstract)Hasuo, Ichiro / Jacobs, Bart / Uustalu, Tarmo et al. | 2007
- 631
-
Holographic Algorithms: The Power of Dimensionality ResolvedCai, Jin-Yi / Lu, Pinyan et al. | 2007
- 643
-
Reconciling Data Compression and Kolmogorov ComplexityBienvenu, Laurent / Merkle, Wolfgang et al. | 2007
- 655
-
Size Competitive Meshing Without Large AnglesMiller, Gary L. / Phillips, Todd / Sheehy, Donald et al. | 2007
- 667
-
A Fully Abstract Trace Semantics for General ReferencesLaird, James et al. | 2007
- 680
-
Aliased Register Allocation for Straight-Line Programs Is NP-CompleteLee, Jonathan K. / Palsberg, Jens / Pereira, Fernando Magno Quintão et al. | 2007
- 692
-
Conservative Ambiguity Detection in Context-Free GrammarsSchmitz, Sylvain et al. | 2007
- 704
-
Lower Bounds for Quantile Estimation in Random-Order and Multi-pass StreamingGuha, Sudipto / McGregor, Andrew et al. | 2007
- 716
-
Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse SpannersElkin, Michael et al. | 2007
- 728
-
Checking and Spot-Checking the Correctness of Priority QueuesChu, Matthew / Kannan, Sampath / McGregor, Andrew et al. | 2007
- 740
-
Undecidability of 2-Label BPP Equivalences and Behavioral Type Systems for the π-CalculusKobayashi, Naoki / Suto, Takashi et al. | 2007
- 752
-
Ready Simulation for Concurrency: It’s Logical!Lüttgen, Gerald / Vogler, Walter et al. | 2007
- 764
-
Continuous Capacities on Continuous State SpacesGoubault-Larrecq, Jean et al. | 2007
- 777
-
On the Chromatic Number of Random GraphsCoja-Oghlan, Amin / Panagiotou, Konstantinos / Steger, Angelika et al. | 2007
- 789
-
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree DistributionsAlon, Noga / Coja-Oghlan, Amin / Hàn, Hiệp / Kang, Mihyun / Rödl, Vojtěch / Schacht, Mathias et al. | 2007
- 801
-
Complexity of the Cover PolynomialBläser, Markus / Dell, Holger et al. | 2007
- 813
-
A Generalization of Cobham’s Theorem to Automata over Real NumbersBoigelot, Bernard / Brusten, Julien et al. | 2007
- 825
-
Minimum-Time Reachability in Timed GamesBrihaye, Thomas / Henzinger, Thomas A. / Prabhu, Vinayak S. / Raskin, Jean-François et al. | 2007
- 838
-
Reachability-Time Games on Timed AutomataJurdziński, Marcin / Trivedi, Ashutosh et al. | 2007
- 850
-
Perfect Information Stochastic Priority GamesGimbert, Hugo / Zielonka, Wiesław et al. | 2007
- 862
-
Bounded Depth Data TreesBjörklund, Henrik / Bojańczyk, Mikołaj et al. | 2007
- 875
-
Unranked Tree Automata with Sibling Equalities and DisequalitiesKarianto, Wong / Löding, Christof et al. | 2007
- 888
-
Regular Languages of Nested Words: Fixed Points, Automata, and SynchronizationArenas, Marcelo / Barceló, Pablo / Libkin, Leonid et al. | 2007
- 901
-
A Combinatorial Theorem for TreesColcombet, Thomas et al. | 2007
- 913
-
Model Theory Makes Formulas LargeDawar, Anuj / Grohe, Martin / Kreutzer, Stephan / Schweikardt, Nicole et al. | 2007
- 925
-
Decision Problems for Lower/Upper Bound Parametric Timed AutomataBozzelli, Laura / Torre, Salvatore et al. | 2007
- 937
-
On the Complexity of Ltl Model-Checking of Recursive State MachinesTorre, Salvatore / Parlato, Gennaro et al. | 2007
- 949
-
Paper Retraction: On the Hardness of Embeddings Between Two Finite MetricsCary, Matthew / Rudra, Atri / Sabharwal, Ashish et al. | 2007