Tison sophie (40 resultados)

Condición: very_good. Gently read. May have name of previous ownership, or ex-library edition. Binding tight; spine straight and smooth, with no creasing; covers clean and crisp. Minimal signs of handling or shelving. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships USPS Media Mail.…

Condición: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Paperback. Condición: Very Good. Sorry, No international shipping on this item.Ex-library paperback in very nice condition with the usual markings and attachments. Except for library markings, interior clean and unmarked. Tight binding.

Condición: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condición: As New. Unread book in perfect condition.

Condición: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

paperback. Condición: Befriedigend. 604 Seiten; 9783540656913.4 Gewicht in Gramm: 1.

Condición: New. In English.

Condición: New.

Paperback. Condición: New. 1994 ed. This volume contains the papers selected for presentation at the 19th Colloquium on Trees in Algebra and Programming (CAAP '94), which was held jointly with the fifth European Symposium on Programming (ESOP '94) in Edinburgh in April 1994. Originally this colloquium series was devoted to the algebraic and combinatorial properties of trees, and their role in various fields of computer science. Taking into account the evolution of computer science, CAAP '94 focuses on logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.); the topics also include applications to computer science provided that algebraic or syntactic methods are involved. The volume contains 21 papers selected from 51 submissions as well as two invited papers.…

Paperback. Condición: Good. Lecture Notes In Computer Science, 1770; 6.1 X 1.55 X 9.25 inches; 660 pages; Ex-Library copy with usual identifiers. Slightly cocked spine. Light rubbing on the covers. Good condition otherwise. No other noteworthy defects. No markings on text pages. ; - Your satisfaction is our priority. We offer free returns and respond promptly to all inquiries. Your item will be carefully cushioned in bubble wrap and securely boxed. All orders ship on the same or next business day. Buy with confidence. 1st Edition (Unstated); No Printing Stated.…

Condición: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Invited Talks.- Combining Shostak Theories.- Multiset Rewriting and Security Protocol Analysis.- Engineering of Logics for the Content-Based Representation of Information.- Regular Papers, Application Papers.- Axiomatic Rewriting Theory VI: Residual Theory Revisited.- Static Analysis of Modularity of -Reduction in the Hyperbalanced -Calculus.- Exceptions in the Rewriting Calculus.- Deriving Focused Lattice Calculi.- Layered Transducing Term Rewriting System and Its Recognizability Preserving Property.- Decidability and Closure Properties of Equational Tree Languages.- Regular Sets of Descendants by Some Rewrite Strategies.- Rewrite Games.- An Extensional Böhm Model.- A Weak Calculus with Explicit Operators for Pattern Matching and Substitution.- Tradeoffs in the Intensional Representation of Lambda Terms.- Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae.- Conditions for Efficiency Improvement by Tree Transducer Composition.- Rewriting Strategies for Instruction Selection.- Probabilistic Rewrite Strategies. Applications to ELAN.- Loops of Superexponential Lengths in One-Rule String Rewriting.- Recursive Derivational Length Bounds for Confluent Term Rewrite Systems Research Paper.- Termination of (Canonical) Context-Sensitive Rewriting.- Atomic Set Constraints with Projection.- Currying Second-Order Unification Problems.- A Decidable Variant of Higher Order Matching.- Combining Decision Procedures for Positive Theories Sharing Constructors.- System Descriptions.- JITty: A Rewriter with Strategy Annotations.- Autowrite: A Tool for Checking Properties of Term Rewriting Systems.- TTSLI: An Implementation of Tree-Tuple Synchronized Languages.- in2: A Graphical Interpreter for Interaction Nets. …

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains the papers selected for presentation at the 19th Colloquium on Trees in Algebra and Programming (CAAP '94), which was held jointly with the fifth European Symposium on Programming (ESOP '94) in Edinburgh in April 1994. Originally this colloquium series was devoted to the algebraic and combinatorial properties of trees, and their role in various fields of computer science. Taking into account the evolution of computer science, CAAP '94 focuses on logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.); the topics also include applications to computer science provided that algebraic or syntactic methods are involved. The volume contains 21 papers selected from 51 submissions as well as two invited papers.…

Condición: As New. Unread book in perfect condition.

Condición: As New. Unread book in perfect condition.

Condición: New.

Condición: New.

Condición: New. In English.

Paperback. Condición: New. 1994 ed. This volume contains the papers selected for presentation at the 19th Colloquium on Trees in Algebra and Programming (CAAP '94), which was held jointly with the fifth European Symposium on Programming (ESOP '94) in Edinburgh in April 1994. Originally this colloquium series was devoted to the algebraic and combinatorial properties of trees, and their role in various fields of computer science. Taking into account the evolution of computer science, CAAP '94 focuses on logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.); the topics also include applications to computer science provided that algebraic or syntactic methods are involved. The volume contains 21 papers selected from 51 submissions as well as two invited papers.…

Condición: New. In English.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Invited Talks.- Algorithms for Selfish Agents.- The Reduced Genus of a Multigraph.- Classifying Discrete Temporal Properties.- Complexity 1.- Circuit Complexity of Testing Square-Free Numbers.- Relating Branching Program Size and Formula Size over the Full Binary Basis.- Theory of Parallel Algorithms 1.- Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines.- The Average Time Complexity to Compute Prefix Functions in Processor Networks.- Complexity 2.- On the Hardness of Permanent.- One-Sided Versus Two-Sided Error in Probabilistic Computation.- Computational Geometry.- An Optimal Competitive Strategy for Walking in Streets.- An Optimal Strategy for Searching in Unknown Streets.- Parallel Searching on m Rays.- Complexity 3.- A Logical Characterisation of Linear Time on Nondeterministic Turing Machines.- Descriptive Complexity of Computable Sequences.- Complexity of Some Problems in Universal Algebra.- Algorithms and Data Structures 1.- New Branchwidth Territories.- Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions.- Treewidth and Minimum Fill-In of Weakly Triangulated Graphs.- Automata and Formal Languages.- Decidability and Undecidability of Marked PCP.- On Quadratic Word Equations.- Some Undecidability Results Related to the Star Problem in Trace Monoids.- Algorithms and Data Structures 2.- An Approximation Algorithm for Max p-Section.- Approximating Bandwidth by Mixing Layouts of Interval Graphs.- Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs.- Complexity 4.- Extending Downward Collapse from 1-versus-2 Queries to j-versus-j + 1 Queries.- Sparse Sets, Approximable Sets, and Parallel Queries to NP.- Algorithms and Data Structures 3.- External Selection.- Fast Computations of the Exponential Function.- Verification.- A Model of Behaviour Abstraction for Communicating Processes.- Model Checking Lossy Vector Addition Systems.- Algorithms and Data Structures 4.- Constructing Light Spanning Trees with Small Routing Cost.- Finding Paths with the Right Cost.- Complexity 5.- In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved .- Lower Bounds for Dynamic Algebraic Problems.- An Explicit Lower Bound for TSP with Distances One and Two.- Theory of Parallel Algorithms 2.- Scheduling Dynamic Graphs.- Supporting Increment and Decrement Operations in Balancing Networks.- Worst-Case Equilibria.- Algorithmic Learning.- A Complete and Tight Average-Case Analysis of Learning Monomials.- Costs of General Purpose Learning.- Universal Distributions and Time-Bounded Kolmogorov Complexity.- Logic in Computer Science.- The Descriptive Complexity Approach to LOGCFL.- The Weakness of Self-Complementation.- On the Difference of Horn Theories.- Complexity 6.- On Quantum Algorithms for Noncommutative Hidden Subgroups.- On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions.- How To Forget a Secret.- Logic in Computer Science 2.- A Modal Fixpoint Logic with Chop.- Completeness of Neighbourhood Logic.- Eliminating Recursion in the -Calculus.- Complexity 7.- On Optimal Algorithms and Optimal Proof Systems.- Space Bounds for Resolution.- Algorithms and Data Structures 5.- Upper Bounds for Vertex Cover Further Improved.- Online Matching for Scheduling Problems.…

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - STACS,the SymposiumonTheoreticalAspects ofComputerScience,isheld- nually, alternating between France and Germany. STACS is organizedjointly by the Special Interest Group for Theoretical Computer Science of the Gesellschaft f ur Informatik (GI) in Germany and the Maison de l Informatique et des Ma- ematiquesDiscr etes(MIMD)inFrance.STACS2000wasthe17thintheseries.It was held in Lille from February 17th to 19th, 2000. Previous STACS symposia took place in Paris (1984), Saarbru cken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992),Wu rzburg(1993),Caen(1994),Mu nchen(1995),Grenoble(1996),Lub eck (1997), Paris (1998), and Trier (1999). All STACS proceedings have been p- lished in the Lecture Notes in Computer Science of Springer-Verlag. STACS has become one of the most important annual meetings in Europe for the theoretical computer science community. It covers a wide range of topics in the area of foundations of computer science. This time, 146 submissions from 30 countries were received, all in electronic form. Jochen Bern designed the electronic submission procedure, which performed marvelously. Many thanks to Jochen.…

Paperback. Condición: Brand New. 1st edition. 662 pages. 9.50x6.25x1.50 inches. In Stock.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This volume contains the papers selected for presentation at the 19th Colloquium on Trees in Algebra and Programming (CAAP 94), which was held jointly with the fifth European Symposium on Programming (ESOP 94) in Edinburgh in April 1994. Originally this c.…

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Invited Talks.- Combining Shostak Theories.- Multiset Rewriting and Security Protocol Analysis.- Engineering of Logics for the Content-Based Representation of Information.- Regular Papers, Application Papers.- Axiomatic Rewriting Theory VI: Residual Theory .…

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This volume contains the papers selected for presentation at the 19th Colloquium on Trees in Algebra and Programming (CAAP '94), which was held jointly with the fifth European Symposium on Programming (ESOP '94) in Edinburgh in April 1994. Originally this colloquium series was devoted to the algebraic and combinatorial properties of trees, and their role in various fields of computer science. Taking into account the evolution of computer science, CAAP '94 focuses on logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.); the topics also include applications to computer science provided that algebraic or syntactic methods are involved. The volume contains 21 papers selected from 51 submissions as well as two invited papers. 372 pp. Englisch.…

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This volume contains the proceedings of the 13th International Conference on Rewriting Techniques and Applications (RTA 2002),which was held July 22- 24,2002 in Copenhagen as part of the 3rd Federated Logic Conference (FLoC 2002). RTA is the ma jor international forum for the presentation of research on all aspects of rewriting. Previous RTA conferences took place in Dijon (1985), Bordeaux (1987),Chapel Hill (1989),Como (1991),Montreal (1993),Kaise- lautern (1995),Rutgers (1996),Sitges (1997),Tsukuba (1998),Trento (1999), Norwich (2000),and Utrecht (2001). A total of 20 regular papers,2 application papers and 4 system descriptions were selected for presentation from 49 submissions from Argentina (1),Brazil 2 1 5 ( ),Czech Republic (1),France (13),Germany (8),Israel ( ),Italy (1 ),Japan 3 3 6 1 (6),The Netherlands (2),Poland (1),Portugal (1 ),Rumania (1),Spain (4),UK 3 5 1 1 ( ),Uruguay ( ),USA (5 ),Venezuela (1). The program committee awarded 6 2 2 the best paper prize to Paul-Andr e Melli` es for his paper Residual Theory Re- sited. This paper presents an elegant and subtle generalization of Jean-Jacques L evy s residual theory. I am especially grateful to the invited speakers Franz Baader,John Mitchell, and Natara jan Shankar for accepting our invitation to present us their insights into their research areas. 404 pp. Englisch.…

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This volume contains the papers selected for presentation at the 19th Colloquium on Trees in Algebra and Programming (CAAP '94), which was held jointly with the fifth European Symposium on Programming (ESOP '94) in Edinburgh in April 1994. Originally this colloquium series was devoted to the algebraic and combinatorial properties of trees, and their role in various fields of computer science. Taking into account the evolution of computer science, CAAP '94 focuses on logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.); the topics also include applications to computer science provided that algebraic or syntactic methods are involved. The volume contains 21 papers selected from 51 submissions as well as two invited papers.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 372 pp. Englisch.…

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Invited Talks.- Combining Shostak Theories.- Multiset Rewriting and Security Protocol Analysis.- Engineering of Logics for the Content-Based Representation of Information.- Regular Papers, Application Papers.- Axiomatic Rewriting Theory VI: Residual Theory Revisited.- Static Analysis of Modularity of -Reduction in the Hyperbalanced -Calculus.- Exceptions in the Rewriting Calculus.- Deriving Focused Lattice Calculi.- Layered Transducing Term Rewriting System and Its Recognizability Preserving Property.- Decidability and Closure Properties of Equational Tree Languages.- Regular Sets of Descendants by Some Rewrite Strategies.- Rewrite Games.- An Extensional Böhm Model.- A Weak Calculus with Explicit Operators for Pattern Matching and Substitution.- Tradeoffs in the Intensional Representation of Lambda Terms.- Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae.- Conditions for Efficiency Improvement by Tree Transducer Composition.- Rewriting Strategies for Instruction Selection.- Probabilistic Rewrite Strategies. Applications to ELAN.- Loops of Superexponential Lengths in One-Rule String Rewriting.- Recursive Derivational Length Bounds for Confluent Term Rewrite Systems Research Paper.- Termination of (Canonical) Context-Sensitive Rewriting.- Atomic Set Constraints with Projection.- Currying Second-Order Unification Problems.- A Decidable Variant of Higher Order Matching.- Combining Decision Procedures for Positive Theories Sharing Constructors.- System Descriptions.- JITty: A Rewriter with Strategy Annotations.- Autowrite: A Tool for Checking Properties of Term Rewriting Systems.- TTSLI: An Implementation of Tree-Tuple Synchronized Languages.- in2: A Graphical Interpreter for Interaction Nets.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 404 pp. Englisch.…