Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Pairwise independence and derandomization / Michael Luby, Avi Wigderson
| Pairwise independence and derandomization / Michael Luby, Avi Wigderson |
| Autore | Luby, Michael |
| Pubbl/distr/stampa | Boston ; Delft : Now, c2006 |
| Descrizione fisica | ix, 67 p. ; 24 cm |
| Disciplina | 004.151 |
| Altri autori (Persone) | Wigderson, Aviauthor |
| Collana | Foundations and trends in theoretical computer science ; 1, n. 4 (2005) |
| Soggetto topico |
Computer science - Mathematics
Computer science - Statistical methods Computational complexity Numbers, Random |
| ISBN | 1933019220 |
| Classificazione |
AMS 68W20
LC QA76.9.M35L83 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991002460969707536 |
Luby, Michael
|
||
| Boston ; Delft : Now, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Randomization and approximation techniques in computer science : second international workshop RANDOM '98, Barcelona, Spain, October 8-10, 1998 : proceedings / / Michael Luby, JoseÌ Rolim, Maria Serna (editors)
| Randomization and approximation techniques in computer science : second international workshop RANDOM '98, Barcelona, Spain, October 8-10, 1998 : proceedings / / Michael Luby, JoseÌ Rolim, Maria Serna (editors) |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [1998] |
| Descrizione fisica | 1 online resource (IX, 385 p.) |
| Disciplina | 004.015114 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Computer science - Statistical methods |
| ISBN | 3-540-49543-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Paper -- Disjoint Paths in Expander Graphs via Random Walks: a Short Survey -- Regular Papers -- A Derandomization Using Min-Wise Independent Permutations -- An Algorithmic Embedding of Graphs via Perfect Matchings -- Deterministic Hypergraph Coloring and Its Applications -- On the Derandomization of Space-Bounded Computations -- Talagrand’s Inequality and Locality in Distributed Computing -- On-line Bin-Stretching -- Combinatorial Linear Programming: Geometry Can Help -- A Note on Bounding the Mixing Time by Linear Programming -- Robotic Exploration, Brownian Motion and Electrical Resistance -- Fringe analysis of synchronized parallel algorithms on 2–3 trees -- On Balls and Bins with Deletions -- “Balls into Bins” — A Simple and Tight Analysis -- Invited Paper -- Tornado Codes: Practical Erasure Codes Based on Random Irregular Graphs -- Regular Papers -- Using Approximation Hardness to Achieve Dependable Computation -- Complexity of Sequential Pattern Matching Algorithms -- A Random Server Model for Private Information Retrieval -- Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract) -- Randomized Lower Bounds for Online Path Coloring -- Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem -- On Various Cooling Schedules for Simulated Annealing Applied to the Job Shop Problem -- A High Performance Approximate Algorithm for the Steiner Problem in Graphs -- Invited Paper -- Random Geometric Problems on [0, 1]2 -- Regular Papers -- A Role of Constraint in Self-Organization -- Constructive Bounds and Exact Expectations for the Random Assignment Problem -- The “Burnside Process” Converges Slowly -- Quicksort Again Revisited -- Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems -- Second-Order Methods for Distributed Approximate Single- and Multicommodity Flow. |
| Record Nr. | UNISA-996466108203316 |
| Berlin ; ; Heidelberg : , : Springer, , [1998] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Randomization, approximation and combinatorial optimization : algorithms and techniques : Third International Workshop on Randomization and approximation Techniques in Computer Science and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX '99 Berkeley, USA, August 8-11, 1999 : proceedings / / Dorit Hochbaum [and three others], editors
| Randomization, approximation and combinatorial optimization : algorithms and techniques : Third International Workshop on Randomization and approximation Techniques in Computer Science and Second International Workshop on Approximation Algorithms for Combinatorial Optimization Problems RANDOM-APPROX '99 Berkeley, USA, August 8-11, 1999 : proceedings / / Dorit Hochbaum [and three others], editors |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer, , [1999] |
| Descrizione fisica | 1 online resource (X, 298 p.) |
| Disciplina | 004.015113 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Computer science - Statistical methods |
| ISBN | 3-540-48413-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Session Random 1 -- Completeness and Robustness Properties of Min-Wise Independent Permutations -- Low Discrepancy Sets Yield Approximate Min-Wise Independent Permutation Families -- Session Approx 1 -- Independent Sets in Hypergraphs with Applications to Routing Via Fixed Paths -- Approximating Minimum Manhattan Networks -- Approximation of Multi-Color Discrepancy -- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem -- Session Approx 2 -- Set Cover with Requirements and Costs Evolving over Time -- Multicoloring Planar Graphs and Partial k-Trees -- Session: Random 2 -- Testing the Diameter of Graphs -- Improved Testing Algorithms for Monotonicity -- Linear Consistency Testing -- Improved Bounds for Sampling Contingency Tables -- Invited Talk -- Probabilistic and Deterministic Approximations of the Permanent -- Session Random 3 -- Improved Derandomization of BPP Using a Hitting Set Generator -- Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets -- Session Approx 3 -- Stochastic Machine Scheduling: Performance Guarantees for LP-Based Priority Policies -- Efficient Redundant Assignments under Fault-Tolerance Constraints -- Scheduling with Machine Cost -- A Linear Time Approximation Scheme for the Job Shop Scheduling Problem -- Invited Talk -- Randomized Rounding for Semidefinite Programs – Variations on the MAX CUT Example -- Session Approx 4 -- Hardness Results for the Power Range Assignment Problem in Packet Radio Networks -- A New Approximation Algorithm for the Demand Routing and Slotting Problem with Unit Demands on Rings -- Session Random 4 -- Algorithms for Graph Partitioning on the Planted Partition Model -- A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest -- Fast Approximate PCPs for Multidimensional Bin-Packing Problems -- Pfaffian Algorithms for Sampling Routings on Regions with Free Boundary Conditions -- Minisymposium on Scheduling Talks -- Scheduling with Unexpected Machine Breakdowns -- Scheduling on a Constant Number of Machines. |
| Record Nr. | UNISA-996465598103316 |
| Berlin ; ; Heidelberg : , : Springer, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
