Vyhledávat v databázi titulů je možné dle ISBN, ISSN, EAN, č. ČNB, OCLC či vlastního identifikátoru. Vyhledávat lze i v databázi autorů dle id autority či jména.
Projekt ObalkyKnih.cz sdružuje různé zdroje informací o knížkách do jedné, snadno použitelné webové služby. Naše databáze v tuto chvíli obsahuje 3152735 obálek a 950729 obsahů českých a zahraničních publikací. Naše API využívá většina knihoven v ČR.
Proceedings of the sixth Annual ACM-SIAM Symposium on Discrete Algorithms
Rok: 1995
ISBN: 9780898713497
OKCZID: 110367753
Citace (dle ČSN ISO 690):
Symposium on Discrete Algorithms. Proceedings of the sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia: Society for Industrial and Applied Mathematics, 1995. 654 stran.
Anotace
Symposium held in San Francisco, California, January 1995 Contents Design of Practical and Provably Good Random Number Generators, William Aiello, Sivaramakrishnan Rajagopalan, and Ramarathnam Venkatesan; On the Statistical Dependencies of Coalesced Hashing and Their Implications for Both Full and Limited Independence, Alan Siegel; On-line Approximate List Indexing with Applications, Arne Andersson and Ola Petersson; Selecting the Median, Dorit Dor and Uri Zwick; Chaining Multiple-Alignment Fragments in Sub-Quadratic Time, Gene Myers and Webb Miller; On the Entropy of DNA: Algorithms and Measurements Based on Memory and Rapid Convergence, Martin Farach, Michiel Noordewier, Serap Savari, Larry Shepp, Abraham Wyner, and Jacob Ziv; Improved Algorithms for Protein Motif Recognition, Bonnie Berger and David B. Wilson; Computing the Local Consensus of Trees, Sampath Kannan, Tandy Warnow, and Shibu Yooseph; Polynomial Methods for Separable Convex Optimization in Unimodular Spaces, Alexander V. Karzanov and S. Thomas McCormick; Algorithms for Graphic Polymatroids and Parametric s-Sets In Memory of Eugene L. Lawler, Harold N. Gabow; A Combinatorial Algorithm for Minimizing Symmetric Submodular Functions, Maurice Queyranne; From Valid Inequalities to Heuristics: A Unified View of Primal-Dual Approximation Algorithms in Covering Problems, Dimitris Bertsimas and Chung-Piaw Teo; Doing Two-Level Logic Minimization 100 Times Faster, Olivier Coudert; Finding Optimal Edge-Rankings of Trees, Xiao Zhou and Takao Nishizeki; Efficient Parallel Computations for Singular Band Matrices, Wayne Eberly; External-Memory Graph Algorithms, Yi-Jen Chiang, Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, and Jeffrey Scott Vitter; Finding Subsets Maximizing Minimum Structures, Magns M. Halldrsson, Kazuo Iwano, Naoki Katoh, and Takeshi Tokuyama; Approximating Discrete Collections via Local Improvements, Magns M. Halldrsson; Randomized Rounding Without Solving the Linear Program, Neal E. Young; Average-Case Analysis of Off-Line and On-Line Knapsack Problems, George S. Lueker; Dihedral Bounds for Mesh Generation in High Dimensions, Marshall Bern, Paul Chew, David Eppstein, and Jim Ruppert; Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions, L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, and Emo Welzl; Multiple Translational Containment: Approximate and Exact Algorithms, Karen Daniels and Victor J. Milenkovic; A New Way to Weigh Malnourished Euclidean Graphs, Gautam Das, Giri Narasimhan, and Jeffrey Salowe; Path Optimization and Near-Greedy Analysis for Graph Partitioning: An Empirical Study, Jonathan Berry and Mark Goldberg; On the Performance of Spectral Graph Partitioning Methods, Stephen Guattery and Gary L. Miller; Guaranteeing Fair Service to Persistent Dependent Tasks, Amotz Bar-Noy, Alain Mayer, Baruch Schieber, and Madhu Sudan; Adapted Diameters and the Efficient Computation of Fourier Transforms on Finite Groups, David K. Maslen and Daniel N. Rockmore; Algorithms for Dynamic Closest Pair and n-Body Potential Fields, Paul B. Callahan and S. Rao Kosaraju.