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.
Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 16th Conference, Hyderabad, India, December 18 - 20, 1996, Proceedings / / edited by Vijay Chandru, V. Vinay
| Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 16th Conference, Hyderabad, India, December 18 - 20, 1996, Proceedings / / edited by Vijay Chandru, V. Vinay |
| Edizione | [1st ed. 1996.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
| Descrizione fisica | 1 online resource (XIII, 395 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Computer logic Algorithms Mathematical logic Computer graphics Theory of Computation Software Engineering/Programming and Operating Systems Logics and Meanings of Programs Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Computer Graphics |
| ISBN | 3-540-49631-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Circuit complexity before the dawn of the new millennium -- A lambda calculus with letrecs and barriers -- Tables -- Mechanized formal methods: Progress and prospects -- The parameter space of the d-step conjecture -- On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees -- Efficient computation of rectilinear geodesic voronoi neighbor in presence of obstacles -- Weak bisimulation and model checking for Basic Parallel Processes -- Testing processes for efficiency -- Regularity is decidable for normed PA processes in polynomial time -- Dynamic maintenance of shortest path trees in simple polygons -- Close approximations of minimum rectangular coverings -- A new competitive algorithm for agent searching in unknown streets -- On the design of hybrid control systems using automata models -- Constraint retraction in FD -- Winskel is (almost) right -- An optimal deterministic algorithm for online b-matching -- Tight bounds for prefetching and buffer management algorithms for parallel I/O systems -- Complexity of the gravitational method for linear programming -- Optimal and information theoretic syntactic Pattern Recognition involving traditional and transposition errors -- Minimal relative normalization in orthogonal expression reduction systems -- Trace consistency and inevitability -- Finite state implementations of knowledge-based programs -- Higher-order proof by consistency -- Advocating ownership -- Non-cancellative Boolean circuits: A generalization of monotone Boolean circuits -- Limitations of the QRQW and EREW PRAM models -- Pinpointing computation with modular queries in the Boolean hierarchy -- Characterization of the principal type of normal forms in an intersection type system -- Correcting type errors in the Curry System -- Immediate fixpoints and their use in groundness analysis -- Graph types for monadic mobile processes. |
| Record Nr. | UNISA-996465976203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings / / edited by Ramesh Hariharan, Madhavan Mukund, V. Vinay
| FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings / / edited by Ramesh Hariharan, Madhavan Mukund, V. Vinay |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 352 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Application software Computer logic Programming languages (Electronic computers) Mathematical logic Theory of Computation Software Engineering/Programming and Operating Systems Computer Applications Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages |
| ISBN | 3-540-45294-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity -- Approximation Schemes for Geometric NP-Hard Problems: A Survey -- On Clustering Using Random Walks -- An Introduction to Decidability of DPDA Equivalence -- Semidefinite Programming Based Approximation Algorithms -- Contributed Papers -- Hard Sets and Pseudo-random Generators for Constant Depth Circuits -- The First-Order Isomorphism Theorem -- Thresholds and Optimal Binary Comparison Search Trees -- Distributed LTL Model Checking Based on Negative Cycle Detection -- Computability and Complexity Results for a Spatial Assertion Language for Data Structures -- Using Nondeterminism to Design Efficient Deterministic Algorithms -- Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter -- A Mechanically Verified Compiling Specification for a Lisp Compiler -- Beyond Regular Model Checking -- Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity -- Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel -- List Decoding from Erasures: Bounds and Code Constructions -- Verification of a Leader Election Algorithm in Timed Asynchronous Systems -- Efficient Addition on Field Programmable Gate Arrays -- The Directed Minimum-Degree Spanning Tree Problem -- I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems -- Beyond Message Sequence Graphs -- Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints -- Properties of Distributed Timed-Arc Petri Nets -- From Falsification to Verification -- On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems -- Range Allocation for Equivalence Logic -- Rewrite Closure for Ground and Cancellative AC Theories. |
| Record Nr. | UNISA-996465672703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science : 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings / / edited by Ramesh Hariharan, Madhavan Mukund, V. Vinay
| FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science : 21st Conference, Bangalore, India, December 13-15, 2001, Proceedings / / edited by Ramesh Hariharan, Madhavan Mukund, V. Vinay |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 352 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Application software Computer logic Programming languages (Electronic computers) Mathematical logic Theory of Computation Software Engineering/Programming and Operating Systems Computer Applications Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages |
| ISBN | 3-540-45294-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity -- Approximation Schemes for Geometric NP-Hard Problems: A Survey -- On Clustering Using Random Walks -- An Introduction to Decidability of DPDA Equivalence -- Semidefinite Programming Based Approximation Algorithms -- Contributed Papers -- Hard Sets and Pseudo-random Generators for Constant Depth Circuits -- The First-Order Isomorphism Theorem -- Thresholds and Optimal Binary Comparison Search Trees -- Distributed LTL Model Checking Based on Negative Cycle Detection -- Computability and Complexity Results for a Spatial Assertion Language for Data Structures -- Using Nondeterminism to Design Efficient Deterministic Algorithms -- Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter -- A Mechanically Verified Compiling Specification for a Lisp Compiler -- Beyond Regular Model Checking -- Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity -- Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel -- List Decoding from Erasures: Bounds and Code Constructions -- Verification of a Leader Election Algorithm in Timed Asynchronous Systems -- Efficient Addition on Field Programmable Gate Arrays -- The Directed Minimum-Degree Spanning Tree Problem -- I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems -- Beyond Message Sequence Graphs -- Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints -- Properties of Distributed Timed-Arc Petri Nets -- From Falsification to Verification -- On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems -- Range Allocation for Equivalence Logic -- Rewrite Closure for Ground and Cancellative AC Theories. |
| Record Nr. | UNINA-9910143920803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||