top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Typed lambda calculi and applications : Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, Nancy, France, April 2-4, 1997 : proceedings / Philippe de Groote, J. Roger Hindley (eds.).
Typed lambda calculi and applications : Third International Conference on Typed Lambda Calculi and Applications, TLCA '97, Nancy, France, April 2-4, 1997 : proceedings / Philippe de Groote, J. Roger Hindley (eds.).
Creatore [International Conference on Typed Lambda Calculi and Applications (3rd : 1997 : Nancy, France)]
Estensione 1 online resource (viii, 404 pages) : illustrations.
Accesso persona De Groote, Philippe
Hindley, J. Roger
Genere/Forma Electronic books
Conference papers and proceedings
Congressen (vorm)
ISBN 9783540684381
3540684387
9783540626886
3540626883
Classificazione 54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto A [lambda]-to-CL translation for strong normalization / Y. Akama -- Typed intermediate languages for shape analysis / G. Bellè, E. Moggi -- Minimum information code in a pure functional language with data types / S. Berardi, L. Boerio -- Matching constraints for the lambda calculus of objects / V. Bono, M. Bugliesi -- Coinductive axiomatization of recursive type equality and subtyping / M. Brandt, F. Henglein -- A simple adequate categorical model for PCF / T. Braüner -- Logical reconstruction of bi-domains / A. Bucciarelli -- A module calculus for pure type systems / J. Courant -- An inference algorithm for strictness / F. Damiani, P. Giannini -- Primitive recursion for higher-order abstract syntax / J. Despeyroux, F. Pfenning, C. Schürmann -- Eta-expansions in dependent type theory : the calculus of constructions / N. Ghani -- Proof nets, garbage, and computations / S. Guerrini, S. Martini, A. Masini -- Recursion from cyclic sharing : traced monoidal categories and models of cyclic lambda calculi / M. Hasegawa -- Games and weak-head reduction for classical PCF / H. Herbelin -- A type theoretical view of Böhm-trees / T. Kurata -- Semantic techniques for deriving coinductive characterizations of observational equivalences for [lambda]-calculi / M. Lenisa -- Schwichtenberg-style lambda definability is undecidable / J. Małolepszy, M. Moczurad, M. Zaionc -- Outermost-fair rewriting / F. van Raamsdonk -- Pomset logic : a non-commutative extension of classical linear logic / C. Retoré -- Computational reflection in the calculus of constructions and its application to theorem proving / H. Ruess -- Names, equations, relations ; practical ways to reason about new / I. Stark -- An axiomatic system of parametricity / I. Takeuti -- Inhabitation in typed lambda-calculi (a syntactic approach) / P. Urzyczyn -- Weak and strong beta normalisations in typed [lambda]-calculli / H. Xi.
Record Nr. UCHICAGO-11072499
[International Conference on Typed Lambda Calculi and Applications (3rd : 1997 : Nancy, France)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Algorithms and complexity : third Italian conference, CIAC '97, Rome, Italy, March 12-14, 1997 : proceedings / Giancarlo Bongiovanni, Daniel Pierre Bovet, Giuseppe Di Battista (eds.).
Algorithms and complexity : third Italian conference, CIAC '97, Rome, Italy, March 12-14, 1997 : proceedings / Giancarlo Bongiovanni, Daniel Pierre Bovet, Giuseppe Di Battista (eds.).
Creatore [Italian Conference on Algorithms and Complexity (3rd : 1997 : Rome, Italy)]
Estensione 1 online resource (viii, 310 pages) : illustrations.
Accesso persona Bongiovanni, Giancarlo
Bovet, Daniel P. (Daniel Pierre)
Di Battista, Giuseppe
Genere/Forma Electronic books
Conference papers and proceedings
Congressen (vorm)
ISBN 9783540683230
3540683232
3540625925
9783540625926
Classificazione 54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Algorithms and Data Structures for Control Dependence and Related Compiler Problems / G. Bilardi -- Embedding Interconnection Networks in Grids via the Layered Cross Product / G. Even and S. Even -- Finding Optimum k-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for K = 3,4,5 / Y. Dinitz and Z. Nutov -- The Optimum Cost Chromatic Partition Problem / K. Jansen -- Fault Tolerant K-Center Problems / S. Khuller, R. Pless and Y.J. Sussmann -- [actual symbol not reproducible] (NP) Distinguished Robust Many-One and Turing Completeness / E. Hemaspaandra, L.A. Hemaspaandra and H. Hempel -- Syntactic Characterization in LISP of the Polynomial Complexity Classes and Hierarchy / S. Caporaso, M. Zito and N. Galesi [and others] -- On the Drift of Short Schedules / U. Feige and G. Rayzman -- On Removing Non-degeneracy Assumptions in Computational Geometry / F. Gomez, S. Ramaswami and G. Toussaint.
Record Nr. UCHICAGO-11072526
[Italian Conference on Algorithms and Complexity (3rd : 1997 : Rome, Italy)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Organized adaption in multi-agent systems : First International Workshop, OAMAS 2008, Estoril, Portugal, May 13, 2008 : revised and invited papers / George Vouros [and others]
Organized adaption in multi-agent systems : First International Workshop, OAMAS 2008, Estoril, Portugal, May 13, 2008 : revised and invited papers / George Vouros [and others]
Creatore [OAMAS 2008 (2008 : Estoril, Portugal)]
Estensione 1 online resource.
Accesso persona Vouros, George A.
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783642023774
3642023770
9783642023767
3642023762
Classificazione 54.10
54.72
TP18-532
TP31-532
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UCHICAGO-11072869
[OAMAS 2008 (2008 : Estoril, Portugal)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Axiomatising the logic of computer programming / Robert Goldblatt
Axiomatising the logic of computer programming / Robert Goldblatt
Creatore [Goldblatt, Robert]
Estensione 1 online resource (xi, 304 pages).
Genere/Forma Electronic books
ISBN 9783540390381
3540390383
3540112103
9783540112105
0387112103
9780387112107
Classificazione 54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UCHICAGO-11073668
[Goldblatt, Robert]  
Materiale a stampa
Lo trovi qui: University of Chicago
Theoretical computer science : exploring new frontiers of theoretical informatics : International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000 : proceedings / Jan van Leeuwen [and others] (eds.).
Theoretical computer science : exploring new frontiers of theoretical informatics : International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000 : proceedings / Jan van Leeuwen [and others] (eds.).
Creatore [International Conference IFIP TCS 2000 (2000 : Sendai-shi, Miyagi-ken, Japan)]
Estensione 1 online resource (xv, 630 pages) : illustrations.
Accesso persona Leeuwen, J. van (Jan)
Genere/Forma Online resources
Conference papers and proceedings
ISBN 9783540449294
3540449299
3540678239
9783540678236
Classificazione 54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Breaking and fixing the Needham-Schroeder public-key protocol using FDR -- Reconciling Two Views of Cryptography -- Theory and Construction of Molecular Computers -- Theory and Construction of Molecular Computers -- On the hardness of the permanent -- List Decoding: Algorithms and Applications -- Approximation Algorithms for String Folding Problems -- Approximation Algorithms for String Folding Problems -- Fast multi-dimensional approximate string matching -- An Index for Two Dimensional String Matching Allowing Rotations -- Parallel Edge Coloring of a Tree on a Mesh Connected Computer -- Parallel Edge Coloring of a Tree on a Mesh Connected Computer -- Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs -- Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs -- It Is on the Boundary: Complexity Considerations for Polynomial Ideals -- It Is on the Boundary: Complexity Considerations for Polynomial Ideals -- An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks -- An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks -- Reducibility among combinatorial problems -- Task Distributions on Multiprocessor Systems -- Fast Interpolation Using Kohonen Self-Organizing Neural Networks -- Fast Interpolation Using Kohonen Self-Organizing Neural Networks -- Steganography Using Modern Arts -- Steganography Using Modern Arts -- Gossiping in Vertex-Disjoint Paths Mode in d-dimensional Grids and Planar Graphs -- Trade-Offs between Density and Robustness in Random Interconnection Graphs -- An effcient way for edge-connectivity augmentation -- The (? + 1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph -- On the Approximability of NP-complete Optimization Problems -- On the Hardness of Approximating Some NP-Optimization Problems Related to Minimum Linear Ordering Problem -- How Many People Can Hide in a Terrain? -- Maximum Clique and Minimum Clique Partition in Visibility Graphs -- Language recognition and the synchronization of cellular automata -- Real-Time Language Recognition by Alternating Cellular Automata -- Inducing an order on cellular automata by a grouping operation -- Damage Spreading and?-Sensitivity on Cellular Automata -- Financial Applications of Monte Carlo and Quasi-Monte Carlo Methods -- Discrepancy Theory and Its Application to Finance -- Fully consistent extensions of partially defined Boolean functions with missing bits -- Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bitsv -- Dealing necessary and sufficient numbers of cards for sharing a one-bit secret key -- Characterization of Optimal Key Set Protocols -- Algebraic Complexity Theory -- On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model -- On Logarithmic Simulated Annealing -- On Logarithmic Simulated Annealing -- Specification and verification of concurrent programs in CESAR -- Hierarchical State Machines -- Validating firewalls in mobile ambients -- Ambient Groups and Mobility Types -- Multiway synchronization verified with coupled simulation -- An Asynchronous, Distributed Implementation of Mobile Ambients -- Graph types for monadic mobile processes -- Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness -- Aliasing Models for Mobile Objects -- Local?-Calculus at Work: Mobile Objects as Mobile Processes -- Typed concurrent objects -- An Interpretation of Typed Concurrent Objects in the Blue Calculus -- Inductive definitions in the system coq. rules and properties -- A Higher-Order Specification of the?-Calculus -- Compositionality through an operational semantics of contexts -- Open Ended Systems, Dynamic Bisimulation and Tile Logic -- Observe behaviour categorically -- Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems -- The Equivalence Problem for Deterministic Pushdown Automata is Decidable -- On the Complexity of Bisimulation Problems for Pushdown Automata -- Session 2.4 -- A Type-Theoretic Study on Partial Continuations -- Partially Typed Terms between Church-Style and Curry-Style -- Alternating Automata and Logics over Infinite Words -- Hypothesis Support for Information Integration in Four-Valued Logics -- Invited Talk 2.2 -- Masaccio: A Formal Model for Embedded Components -- Session 2.5 -- A Single Complete Refinement Rule for Demonic Specifications -- Reasoning about Composition Using Property Transformers and Their Conjugates -- Invited Talk 2.3 -- Some New Directions in the Syntax and Semantics of Formal Languages -- Panel Discussion on New Challanges for TCS -- New Challenges for Theoretical Computer Science -- Algorithm Design Challenges -- Quantumization of Theoretical Informatics -- Two Problems in Wide Area Network Programming -- New Challenges for Computational Models -- Towards a Computational Theory of Everything -- Open Lectures -- On the Power of Interactive Computing -- The Varieties of Programming Language Semantics.
Record Nr. UCHICAGO-11066999
[International Conference IFIP TCS 2000 (2000 : Sendai-shi, Miyagi-ken, Japan)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Fundamentals of computation theory : 13th international symposium, FCT 2001, Riga, Latvia, August 22-24, 2001 : proceedings / Rūsin̦š Freivalds (ed.).
Fundamentals of computation theory : 13th international symposium, FCT 2001, Riga, Latvia, August 22-24, 2001 : proceedings / Rūsin̦š Freivalds (ed.).
Creatore [FCT 2001 (2001 : Rīga, Latvia)]
Estensione 1 online resource (xiii, 542 pages) : illustrations.
Accesso persona Freĭvald, R. V.
Genere/Forma Online resources
Conference papers and proceedings
Congressen (vorm)
ISBN 9783540446699
3540446699
9783540424871
3540424873
Classificazione 54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Papers -- Towards Axiomatic Basis of Inductive Inference -- Approximation Algorithms for Fractional Covering and Packing Problems, and Applications -- Challenges of Commutation -- Approximating Bounded Degree Instances of NP-Hard Problems -- Universal Algebra and Computer Science -- Quantum Algorithms -- Regular Papers -- A Discrete Approximation and Communication Complexity Approach to the Superposition Problem -- On Computational Power of Quantum Branching Programs -- Efficient Computation of Singular Moduli with Application in Cryptography -- Ambainis-Freivalds' Algorithm for Measure-Once Automata -- Are There Essentially Incomplete Knowledge Representation Systems? -- Best Increments for the Average Case of Shellsort -- Approximating Minimum Cocolourings -- Curved Edge Routing -- Time/Space Efficient Compressed Pattern Matching -- Modelling Change with the Aid of Knowledge and Time -- If P? NP then Some Strongly Noninvertible Functions Are Invertible -- Prediction-Preserving Reducibility with Membership Queries on Formal Languages -- Dense Families and Key Functions of Database Relation Instances -- On the Complexity of Decidable Cases of Commutation Problem for Languages -- Cones, Semi-AFPs, and AFPs of Algebraic Power Series -- New Small Universal Circular Post Machines -- Divisibility Monoids: Presentation, Word Problem, and Rational Languages -- Concurrency in Timed Automata -- How Powerful Are Infinite Time Machines? -- Equivalence Problem of Composite Class Diagrams -- Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2 -- On the Category of Event Structures with Dense Time -- Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions -- Monte-Carlo Polynomial versus Linear Time -- The Truth-Table Case -- Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies -- Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables -- Piecewise and Local Threshold Testability of DFA -- Compositional Homomorphisms of Relational Structures -- Short Papers -- Representation of Autonomous Automata -- Quantum Reversibility and a New Model of Quantum Automaton -- Space-Efficient 1.5-Way Quantum Turing Machine -- A Combinatorial Aggregation Algorithm for Stationary Distribution of a Large Markov Chain -- A Primitive for Proving the Security of Every Bit and about Universal Hash Functions & Hard Core Bits -- Pythagorean Triples in Unification Theory of Nilpotent Rings -- Two-States Bilinear Intrinsically Universal Cellular Automata -- Linear Time Recognizer for Subsets of?2 -- Fuzzy Sets and Algorithms of Distributed Task Allocation for Cooperative Agents -- On Recursively Enumerable Subsets of N and Rees Matrix Semigroups over (Z3 ; +) -- Quantum Real -- Time Turing Machine -- Mathematical Models and Optimal Algorithms of Dynamic Data Structure Control -- Linear Automata and Recognizable Subsets in Free Semirings -- On Logical Method for Counting Dedekind Numbers -- A General Method for Graph Isomorphism -- WEA Invited Papers -- Designing PTASs for MIN-SUM Scheduling Problems -- On Robust Algorithms for the Maximum Weight Stable Set Problem -- Multicasting in Optical Networks -- WEA Regular Papers -- Structured Randomized Rounding and Coloring -- Optimal Online Flow Time with Resource Augmentation -- New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs -- On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks -- Approximation Algorithms for Time-Dependent Orienteering -- On Complexity of Colouring Mixed Hypertrees -- Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems -- The Complexity of Maximum Matroid-Greedoid Intersection.
Record Nr. UCHICAGO-11067013
[FCT 2001 (2001 : Rīga, Latvia)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Generalized quantifiers and computation : 9th European Summer School in Logic, Language, and Information, ESSLLI'97 workshop : Aix-en-Provence, France, August 11-22, 1997 : revised lectures / Jouko Väänänen (ed.).
Generalized quantifiers and computation : 9th European Summer School in Logic, Language, and Information, ESSLLI'97 workshop : Aix-en-Provence, France, August 11-22, 1997 : revised lectures / Jouko Väänänen (ed.).
Creatore [European Summer School in Logic, Language, and Information (9th : 1997 : Aix-en Provence, France)]
Estensione 1 online resource (139 pages) : illustrations.
Accesso persona Väänänen, J. (Jouko), 1950-
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783540465836
3540465839
9783540669937
3540669930
Classificazione 54.10
31.10
17.46
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Generalized quantifiers, an introduction / Jouko Väänänen -- Counting and locality over finite structures : a survey / Leonid Libkin, Juha Nurmonen -- A perspective on Lindström quantifiers and oracles / Iain A. Stewart -- Generalized quantifiers in logic programs / Thomas Eiter, Georg Gottlob, Helmut Veith -- A generalized quantifier concept in computational complexity theory / Heribert Vollmer -- Ramsey theory is needed for solving definability problems of generalized quantifiers / Kerkko Luosto.
Record Nr. UCHICAGO-11064609
[European Summer School in Logic, Language, and Information (9th : 1997 : Aix-en Provence, France)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Correct system design : recent insights and advances / Ernst-Rüdiger Olderog, Bernhard Steffen (eds.).
Correct system design : recent insights and advances / Ernst-Rüdiger Olderog, Bernhard Steffen (eds.).
Estensione 1 online resource (xiv, 415 pages) : illustrations.
Accesso persona Steffen, Bernhard
Olderog, E.-R.
Genere/Forma Electronic books
ISBN 9783540480921
3540480927
9783540666240
3540666249
Classificazione 54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Theories of programming : top-down and bottom-up and meeting in the middle / C.A.R. Hoare -- A triptych software development paradigm : domain, requirements and software / D. Bjørner -- Real-time constraints through the ProCoS layers / A.P. Ravn, H. Rischel -- Monotonicity in calculational proofs / D. Gries -- The Alma project, or how first-order logic can help us in imperative programming / K.R. Apt, A. Schaerf -- Type and effect systems / F. Nielson, H.R. Nielson -- Proving theorems about Java-like byte code / J.S. Moore -- Multiple state and single state tableaux for combining local and global model checking / A. Biere, E.M. Clarke, Y. Zhu -- On the existence of network invariants for verifying parameterized systems / P.A. Abdulla, B. Jonsson -- Verification of compilers / G. Goos, W. Zimmermann -- Translation validation : from SIGNAL to C / A. Pnueli, O. Shtrichman, M. Siegel -- Compilation and synthesis for real-time embedded controllers / M. Fränzle, M. Müller-Olm -- Optimization under the perspective of soundness, completeness, and reusability / J. Knoop, O. Rüthing -- Verification of automotive control units / T. Bienmüller [and others] -- Correct real-time software for programmable logic controllers / E.-R. Olderog -- Formal methods for the International Space Station ISS / J. Peleska, B. Buth -- METAFrame in practice : design of intelligent network services / B. Steffen, T. Margaria.
Record Nr. UCHICAGO-11064615
Materiale a stampa
Lo trovi qui: University of Chicago
Algorithm theory - SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 : proceedings / Martti Penttonen, Erik Meineche Schmidt (eds.).
Algorithm theory - SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 : proceedings / Martti Penttonen, Erik Meineche Schmidt (eds.).
Creatore [Scandinavian Workshop on Algorithm Theory (8th : 2002 : Turku, Finland)]
Estensione 1 online resource (xiv, 450 pages) : illustrations.
Accesso persona Penttonen, Martti, 1948-
Schmidt, E. M. (Erik Meineche), 1945-
Genere/Forma Electronic books
ISBN 9783540454717
3540454713
9783540438663
3540438661
Classificazione 54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Speakers -- An Efficient Quasidictionary -- Combining Pattern Discovery and Probabilistic Modeling in Data Mining -- Scheduling -- Time and Space Efficient Multi-method Dispatching -- Linear Time Approximation Schemes for Vehicle Scheduling -- Minimizing Makespan for the Lazy Bureaucrat Problem -- A PTAS for the Single Machine Scheduling Problem with Controllable Processing Times -- Computational Geometry -- Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains -- Simplex Range Searching and k Nearest Neighbors of a Line Segment in 2D -- Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains -- Exact Algorithms and Approximation Schemes for Base Station Placement Problems -- A Factor-2 Approximation for Labeling Points with Maximum Sliding Labels -- Optimal Algorithm for a Special Point-Labeling Problem -- Random Arc Allocation and Applications -- On Neighbors in Geometric Permutations -- Graph Algorithms -- Powers of Geometric Intersection Graphs and Dispersion Algorithms -- Efficient Data Reduction for Dominating Set: A Linear Problem Kernel for the Planar Case -- Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous -- Approximation Hardness of the Steiner Tree Problem on Graphs -- The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus -- The Dynamic Vertex Minimum Problem and Its Application to Clustering-Type Approximation Algorithms -- A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid -- Approximation Algorithms for Edge-Dilation k-Center Problems -- Forewarned Is Fore-Armed: Dynamic Digraph Connectivity with Lookahead Speeds Up a Static Clustering Algorithm -- Improved Algorithms for the Random Cluster Graph Model --?-List Vertex Coloring in Linear Time -- Robotics -- Robot Localization without Depth Perception -- Online Parallel Heuristics and Robot Searching under the Competitive Framework -- Analysis of Heuristics for the Freeze-Tag Problem -- Approximation Algorithms -- Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems -- All-Norm Approximation Algorithms -- Approximability of Dense Instances of Nearest Codeword Problem -- Data Communication -- Call Control with k Rejections -- On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem -- Packet Bundling -- Algorithms for the Multi-constrained Routing Problem -- Computational Biology -- Computing the Threshold for q-Gram Filters -- On the Generality of Phylogenies from Incomplete Directed Characters -- Data Storage and Manipulation -- Sorting with a Forklift -- Tree Decompositions with Small Cost -- Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition -- Performance Tuning an Algorithm for Compressing Relational Tables -- A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset -- Paging on a RAM with Limited Resources -- An Optimal Algorithm for Finding NCA on Pure Pointer Machines -- Amortized Complexity of Bulk Updates in AVL-Trees.
Record Nr. UCHICAGO-11066119
[Scandinavian Workshop on Algorithm Theory (8th : 2002 : Turku, Finland)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Optimal algorithms : international symposium, Varna, Bulgaria, May 29-June 2 1989 proceedings / H. Djidjev, ed.
Optimal algorithms : international symposium, Varna, Bulgaria, May 29-June 2 1989 proceedings / H. Djidjev, ed.
Estensione 1 online resource (vi, 308 pages) : illustrations.
Accesso persona Djidjev, H. (Hristo), 1955-
Accesso ente Bŭlgarska akademii︠a︡ na naukite.Center of Informatics and Computer Technology
Accesso convegno International Symposium on Optimal Algorithms (2nd : 1989 : Varna, Bulgaria)
Genere/Forma Electronic resources (Books)
Electronic books
Conference papers and proceedings
Congressen (vorm)
ISBN 9783540468318
3540468315
0387518592
9780387518596
3540518592
9783540518594
Classificazione 54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UCHICAGO-11077338
Materiale a stampa
Lo trovi qui: University of Chicago