Return to home page
Searching: Otterbein library catalog
Some OPAL libraries remain closed or are operating at reduced service levels. Materials from those libraries may not be requestable; requested items may take longer to arrive. Note that pickup procedures may differ between libraries. Please contact your library for new procedures, specific requests, or other assistance.
  Previous Record Previous Item Next Item Next Record
  Reviews, Summaries, etc...
EBOOK
Conference International Workshop on Randomization and Approximation Techniques in Computer Science (2nd : 1998 : Barcelona, Spain)
Title 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 (eds.).
Imprint Berlin ; New York : Springer, 1998.

LOCATION CALL # STATUS MESSAGE
 OHIOLINK SPRINGER EBOOKS    ONLINE  
View online
LOCATION CALL # STATUS MESSAGE
 OHIOLINK SPRINGER EBOOKS    ONLINE  
View online
Conference International Workshop on Randomization and Approximation Techniques in Computer Science (2nd : 1998 : Barcelona, Spain)
Series Lecture notes in computer science ; 1518.
Lecture notes in computer science ; 1518.
Subject Computer science -- Statistical methods -- Congresses.
Alt Name Luby, Michael George.
Serna, Maria, 1959-
Rolim, José D. P.
Ohio Library and Information Network.
LINK (Online service)
Add Title RANDOM '98
Description ix, 383 pages : illustrations ; 24 cm.
monochrome rdacc
Bibliography Note Includes bibliographical references and index
Contents 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.
Access Available to OhioLINK libraries
Summary This book constitutes the refereed proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM'98, held in Barcelona, Spain, in October 1998. The 26 revised full papers presented were carefully reviewed and selected for inclusion in the proceedings. Also included are three invited contributions. Among the topics addressed are graph computation, derandomization, pattern matching, computational geometry, approximation algorithms, search algorithms, sorting, and networking algorithms.
Reproduction Electronic reproduction. Columbus, OH : OhioLINK, 2008.
System Details Mode of access: World Wide Web
ISBN 354065142X (pbk. : alk. paper)
9783540651420 (pbk. : alk. paper)
OCLC # 690009915
Link OhioLINK electronic book center (OCoLC)180989150.
SpringerLink (OCoLC)43927870.
Additional Format Print version: RANDOM '98 (1998 : Barcelona, Spain). Randomization and approximation techniques in computer science. Berlin ; New York : Springer, 1998 354065142X (OCoLC)39906131.


If you experience difficulty accessing or navigating this content, please contact the OPAL Support Team