40th Annual Symposium on Foundations of Computer Science : [proceedings] (Englisch)
- Neue Suche nach: Symposium on Foundations of Computer Science
- Weitere Informationen zu Symposium on Foundations of Computer Science:
- http://d-nb.info/gnd/3045473-6
- Neue Suche nach: IEEE Computer Society
- Weitere Informationen zu IEEE Computer Society:
- http://d-nb.info/gnd/25694-8
- Neue Suche nach: IEEE Computer Society, Technical Committee on Mathematical Foundations of Computing
- Weitere Informationen zu IEEE Computer Society, Technical Committee on Mathematical Foundations of Computing:
- http://d-nb.info/gnd/212655-2
- Neue Suche nach: Symposium on Foundations of Computer Science
- Weitere Informationen zu Symposium on Foundations of Computer Science:
- http://d-nb.info/gnd/3045473-6
- Neue Suche nach: IEEE Computer Society
- Weitere Informationen zu IEEE Computer Society:
- http://d-nb.info/gnd/25694-8
- Neue Suche nach: IEEE Computer Society, Technical Committee on Mathematical Foundations of Computing
- Weitere Informationen zu IEEE Computer Society, Technical Committee on Mathematical Foundations of Computing:
- http://d-nb.info/gnd/212655-2
1999
-
ISBN:
- Konferenzband / Print
-
Titel:40th Annual Symposium on Foundations of Computer Science : [proceedings]
-
Beteiligte:
-
Kongress:Annual Symposium on Foundations of Computer Science ; 40 ; 1999 ; New York, NY
FOCS '99 ; 40 ; 1999 ; New York, NY
IEEE Annual Conference on Foundations of Computer Science ; 40 ; 1999 ; New York, NY -
Verlag:
- Neue Suche nach: IEEE Computer Society
-
Erscheinungsort:Los Alamitos, Calif. [u.a.]
-
Erscheinungsdatum:1999
-
Format / Umfang:XIV, 668 S
-
Anmerkungen:IEEE catalog number 99CB37039
-
ISBN:
-
Medientyp:Konferenzband
-
Format:Print
-
Sprache:Englisch
-
Reportnr. / Förderkennzeichen:99CB37039
- Neue Suche nach: 54.10
- Weitere Informationen zu Basisklassifikation
-
Klassifikation:
-
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.
- 2
-
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median ProblemsJain, K. / Vazirani, V. V. / IEEE et al. | 1999
- 14
-
Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random FieldsKleinberg, J. / Tardos, E. / IEEE et al. | 1999
- 24
-
Approximating Fractional Multicommodity Flow Independent of the Number of CommoditiesFleischer, L. K. / IEEE et al. | 1999
- 32
-
Approximation Schemes for Minimizing Average Weighted Completion Time with Release DatesAfrati, F. / Bampis, E. / Chekuri, C. / Karger, D. / Kenyon, C. / Khanna, S. / Milis, I. / Queyranne, M. / Skutella, M. / Stein, C. et al. | 1999
- 45
-
A &unknown;n^2-Lower Bound for the Rank of nxn-Matrix Multiplication over Arbitrary FieldsBlaser, M. / IEEE et al. | 1999
- 51
-
Improved Bounds for Sampling ColoringsVigoda, E. / IEEE et al. | 1999
- 60
-
A Non-linear Time Lower Bound for Boolean Branching ProgramsAjtai, M. / IEEE et al. | 1999
- 71
-
Derandomizing Arthur-Merlin Games Using Hitting SetsMiltersen, P. B. / Vinodchandran, N. V. / IEEE et al. | 1999
- 81
-
Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in DigraphsKing, V. / IEEE et al. | 1999
- 91
-
Knuth Prize LectureLovasz, L. / IEEE et al. | 1999
- 92
-
Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized TimeChan, T. M. / IEEE et al. | 1999
- 100
-
Taking a Walk in a Planar ArrangementHar-Peled, S. / IEEE et al. | 1999
- 112
-
PSPACE Has Constant-round Quantum Interactive Proof SystemsWatrous, J. / IEEE et al. | 1999
- 120
-
Verifiable Random FunctionsMicali, S. / Rabin, M. / Vadhan, S. / IEEE et al. | 1999
- 131
-
How Asymmetry Helps Load BalancingVocking, B. / IEEE et al. | 1999
- 142
-
Noncryptographic Selection ProtocolsFeige, U. / IEEE et al. | 1999
- 154
-
A Sublinear Time Approximation Scheme for Clustering in Metric SpacesIndyk, P. / IEEE et al. | 1999
- 160
-
Efficient Regular Data Structures and Algorithms for Location and Proximity ProblemsAmir, A. / Efrat, A. / Indyk, P. / Samet, H. / IEEE et al. | 1999
- 171
-
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via EmbeddingsFarach-Colton, M. / Indyk, P. / IEEE et al. | 1999
- 181
-
Near-Optimal Conversion of Hardness into Pseudo-RandomnessImpagliazzo, R. / Shaltiel, R. / Wigderson, A. / IEEE et al. | 1999
- 191
-
Error Reduction for ExtractorsRaz, R. / Reingold, O. / Vadhan, S. / IEEE et al. | 1999
- 202
-
Primality and Identity Testing Via Chinese RemainderingAgrawal, M. / Biswas, S. / IEEE et al. | 1999
- 210
-
On Counting Independent Sets in Sparse GraphsDyer, M. / Frieze, A. / Jerrum, M. / IEEE et al. | 1999
- 218
-
Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical PhysicsBorgs, C. / Chayes, J. / Frieze, A. / Kim, J. H. / Tetali, P. / Vigoda, E. / Vu, V. H. / IEEE et al. | 1999
- 230
-
Random Walks on Truncated Cubes and Sampling 0-1 Knapsack SolutionsMorris, B. / Sinclair, A. / IEEE et al. | 1999
- 241
-
Markovian Coupling vs. Conductance for the Jerrum-Sinclair ChainKumar, V. S. A. / Ramesh, H. / IEEE et al. | 1999
- 253
-
A Near-Tight Lower Bound on the Time Complexity of Distributed MST ConstructionPeleg, D. / Rubinovich, V. / IEEE et al. | 1999
- 262
-
Long-lived Adaptive Collect with ApplicationsAftek, Y. / Stupp, G. / Touitou, D. / IEEE et al. | 1999
- 273
-
A Theoretical Framework for Memory-Adaptive AlgorithmsBarve, R. D. / Vitter, J. S. / IEEE et al. | 1999
- 285
-
Cache-Oblivious AlgorithmsFrigo, M. / Leiserson, C. E. / Prokop, H. / Ramachandran, S. / IEEE et al. | 1999
- 299
-
The Directed Steiner Network Problem is Tractable for a Constant Number of TerminalsFeldman, J. / Ruhl, M. / IEEE et al. | 1999
- 309
-
Setting Parameters by ExampleEppstein, D. / IEEE et al. | 1999
- 319
-
Finding Double Euler Trails of Planar Graphs in Linear TimeChen, Z.-Z. / He, X. / Huang, C.-H. / IEEE et al. | 1999
- 330
-
Edge-Disjoint Routing in Plane Switch Graphs in Linear TimeWeihe, K. / IEEE et al. | 1999
- 341
-
On Quantum and Classical Space-bounded Processes with Algebraic Transition AmplitudesWatrous, J. / IEEE et al. | 1999
- 352
-
A Better Lower Bound for Quantum Algorithms Searching an Ordered ListAmbainis, A. / IEEE et al. | 1999
- 358
-
Bounds for Small-Error and Zero-Error Quantum AlgorithmsBuhrman, H. / Cleve, R. / de Wolf, R. / Zalka, C. / IEEE et al. | 1999
- 369
-
Optimal Lower Bounds for Quantum Automata and Random Access CodesNayak, A. / IEEE et al. | 1999
- 378
-
Improved Combinatorial Algorithms for the Facility Location and k-Median ProblemsCharikar, M. / Guha, S. / IEEE et al. | 1999
- 389
-
Lovasz's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its ApplicationsKatoh, N. / Tokuyama, T. / IEEE et al. | 1999
- 399
-
Cuts, Trees and l~1-Embeddings of GraphsGupta, A. / Newman, I. / Rabinovich, Y. / Sinclair, A. / IEEE et al. | 1999
- 410
-
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction ProblemsSchoning, U. / IEEE et al. | 1999
- 415
-
Random CNF's are Hard for the Polynomial CalculusBen-Sasson, E. / Impagliazzo, R. / IEEE et al. | 1999
- 422
-
A Study of Proof Search Algorithms for Resolution and Polynomial CalculusBonet, M. L. / Galesi, N. / IEEE et al. | 1999
- 433
-
Online Scheduling to Minimize Average StretchMuthukrishnan, S. / Rajaraman, R. / Shaheen, A. / Gehrke, J. E. / IEEE et al. | 1999
- 444
-
Weak Adversaries for the k-Server ProblemKoutsoupias, E. / IEEE et al. | 1999
- 450
-
Finely-Competitive PagingBlum, A. / Burch, C. / Kalai, A. / IEEE et al. | 1999
- 459
-
On the Complexity of SATLipton, R. J. / Viglas, A. / IEEE et al. | 1999
- 465
-
Hardness of Approximating Sigma~2^p Minimization ProblemsUmans, C. / IEEE et al. | 1999
- 475
-
Hardness of Approximating the Minimum Distance of a Linear CodeDumer, I. / Micciancio, D. / Sudan, M. / IEEE et al. | 1999
- 486
-
On Universal and Fault-Tolerant Quantum Computing: A Novel Basis and a New Constructive Proof of Universality for Shor's BasisBoykin, P. O. / Mor, T. / Pulver, M. / Roychowdhury, V. / Vatan, F. / IEEE et al. | 1999
- 495
-
Satisfiability of Word Equations with Constants is in PSPACEPlandowski, W. / IEEE et al. | 1999
- 501
-
An Approximate L^1-Difference Algorithm for Massive Data StreamsFeigenbaum, J. / Kannan, S. / Strauss, M. / Viswanathan, M. / IEEE et al. | 1999
- 512
-
Algorithmic Aspects of Protein Structure SimilarityGoldman, D. / Istrail, S. / Papadimitriou, C. H. / IEEE et al. | 1999
- 523
-
Magic FunctionsDwork, C. / Naor, M. / Reingold, O. / Stockmeyer, L. / IEEE et al. | 1999
- 535
-
Limits on the Efficiency of One-Way Permutation-Based Hash FunctionsKim, J. H. / Simon, D. R. / Tetali, P. / IEEE et al. | 1999
- 543
-
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext SecuritySahai, A. / IEEE et al. | 1999
- 554
-
Non-Interactive CryptoComputing For NC^1Sander, T. / Young, A. / Yung, M. / IEEE et al. | 1999
- 568
-
Fairness in Routing and Load BalancingKleinberg, J. / Rabani, Y. / Tardos, E. / IEEE et al. | 1999
- 579
-
Stochastic Load Balancing and Related ProblemsGoel, A. / Indyk, P. / IEEE et al. | 1999
- 587
-
Reducing Network Congestion and Blocking Probability Through Balanced AllocationLuczak, M. J. / Upfal, E. / IEEE et al. | 1999
- 596
-
Finding Maximal Repetitions in a Word in Linear TimeKolpakov, R. / Kucherov, G. / IEEE et al. | 1999
- 605
-
All Pairs Shortest Paths in Undirected Graphs with Integer WeightsShoshan, A. / Zwick, U. / IEEE et al. | 1999
- 616
-
An Algorithmic Theory of Learning: Robust Concepts and Random ProjectionArriaga, R. I. / Vempala, S. / IEEE et al. | 1999
- 624
-
Boosting and Hard-Core SetsKlivans, A. R. / Servedio, R. A. / IEEE et al. | 1999
- 634
-
Learning Mixtures of GaussiansDasgupta, S. / IEEE et al. | 1999
- 645
-
Regular Languages Are Testable with a Constant Number of QueriesAlon, N. / Krivelevich, M. / Newman, I. / Szegedy, M. / IEEE et al. | 1999
- 656
-
Efficient Testing of Large GraphsAlon, N. / Fischer, E. / Krivelevich, M. / Szegedy, M. / IEEE et al. | 1999
- iii
-
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)| 1999