This volume constitutes the refereed proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP '96), held at Paderborn, Germany, in July 1996. ICALP is an annual conference sponsored by the European Association on Theoretical Computer Science (EATCS).The proceedings contain 52 refereed papers selected from 172 submissions and 4 invited papers. The papers cover the whole range of theoretical computer science; they are organized in sections on: Process Theory; Fairness, Domination, and the u-Calculus; Logic and Algebra; Languages and Processes; Algebraic Complexity; Graph Algorithms; Automata; Complexity Theory; Combinatorics on Words; Algorithms; Lower Bounds; Data Structures...

Produktinformation

Utgivningsdatum1996-06-26
Mått155 x 235 x 38 mm
Vikt1 042 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor684
Upplaga1996
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540614401

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT

Saturation-based theorem proving (abstract).- Bandwidth efficient parallel computation.- Variable-length maximal codes.- Lower bounds for prepositional proofs and independence results in bounded arithmetic.- Algebraic characterizations of decorated trace equivalences over tree-like structures.- Fast asynchronous systems in dense time.- A hierarchy theorem for the ?-calculus.- An effective tableau system for the linear time ?-calculus.- Characterizing fairness implementability for multiparty interaction.- Termination of context-sensitive rewriting by rewriting.- A complete gentzen-style axiomatization for set constraints.- Fatal errors in conditional expressions.- Different types of arrow between logical frameworks.- Effective models of polymorphism, subtyping and recursion (extended abstract).- Regularity for a large class of context-free processes is decidable.- On infinite transition graphs having a decidable monadic theory.- Semi-groups acting on context-free graphs.- Hard sets method and semilinear reservoir method with applications.- Random polynomials and polynomial factorization.- Optimal gröbner base algorithms for binomial ideals.- Minimum fill-in on circle and circular-arc graphs.- Practical approximation schemes for maximum induced-subgraph problems on K 3,3-free or K 5-free graphs.- Searching a fixed graph.- Improved sampling with applications to dynamic graph algorithms.- The expressive power of existential first order sentences of büchi's sequential calculus.- Fixpoints for rabin tree automata make complementation easy.- New upper bounds to the limitedness of distance automata.- Recognizing regular expressions by means of dataflow networks.- On the power of randomized branching programs.- Hitting sets derandomize BPP.- On type-2 probabilisticquantifiers.- Speeding-up single-tape nondeterministic computations by single alternation, with separation results.- On ?-generators and codes.- On standard Sturmian morphisms.- Constructions and bounds for visual cryptography.- On capital investment.- Lower bounds for static dictionaries on RAMs with bit operations but no multiplication.- Lower bounds for row minima searching.- On the complexity of relational problems for finite state processes.- Deciding finiteness of Petri nets up to bisimulation.- Mobile processes with a distributed environment.- The meaning of negative premises in transition system specifications II.- Average case analyses of list update algorithms, with applications to data compression.- Self-organizing data structures with dependent accesses.- Lopsided trees: Analyses, algorithms, and applications.- Optimal logarithmic time randomized suffix tree construction.- Improved parallel approximation of a class of integer programming problems.- Efficient collective communication in optical networks.- Shared-memory simulations on a faulty-memory DMM.- Fast deterministic backtrack search.- Agent rendezvous: A dynamic symmetry-breaking problem.- Efficient asynchronous consensus with the value-oblivious adversary scheduler.- A formal framework for evaluating heuristic programs.- Improved scheduling algorithms for minsum criteria.- On the complexity of string folding.- A polynomial-time algorithm for near-perfect phylogeny.

Mer från samma författare

Algorithms - ESA 2001

Friedhelm Meyer auf der Heide

Häftad, 2001

749 kr

Parallel Architectures and Their Efficient Use

Friedhelm Meyer auf der Heide, Burkhard Monien, Arnold L. Rosenberg

Häftad, 1993

749 kr

Algorithms for Sensor Systems

Paola Flocchini, Jie Gao, Evangelos Kranakis, Friedhelm Meyer auf der Heide

Häftad, 2014

749 kr

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

749 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

729 kr

Compiler Construction

Albert Cohen

Häftad, 2014

719 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

729 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

749 kr

Computer Science Logic

Dirk van Dalen, Marc Bezem

Häftad, 1997

749 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

749 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 219 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

749 kr

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi - Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops, Häftad

Del 15401

Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi

Häftad, 2025

969 kr

Du kanske också är intresserad av

Parallel Architectures and Their Efficient Use

Friedhelm Meyer auf der Heide, Burkhard Monien, Arnold L. Rosenberg

Häftad, 1993

749 kr

Automata, Languages and Programming

Timo Lepistö, Arto Salomaa

Häftad, 1988

1 439 kr

Automata, Languages and Programming

A. Salomaa, M. Steinby

Häftad, 1977

529 kr

Automata, Languages, and Programming

Fedor V. Fomin, Rusins Freivalds, Marta Kwiatkowska, David Peleg

Häftad, 2013

749 kr

Automata, Languages and Programming

Michele Bugliesi, Bart Preneel, Vladimiro Sassone, Ingo Wegener

Häftad, 2006

1 489 kr

Automata, Languages and Programming

Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas, Wolfgang Thomas

Häftad, 2009

1 439 kr

Automata, Languages and Programming

J. W. de Bakker, J. van Leeuwen

Häftad, 1980

699 kr

Tools for Statistical Inference

Martin A. Tanner

Inbunden, 1996

1 719 kr

Automata, Languages and Programming

Andrzej Lingas, Rolf Karlsson, Svante Carlsson

Häftad, 1993

1 479 kr

Automata, Languages and Programming

Pierpaolo Degano, Roberto Gorrieri, Alberto Marchetti-Spaccamela

Häftad, 1997

1 479 kr

Del i serien Lecture Notes in Computer Science

Automata, Languages and Programming

23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings

Häftad, Engelska, 1996

AvFriedhelm Meyer auf der Heide,Burkhard Monien

1 479 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (10)

Häftad

599 kr

Skickas inom 10-15 vardagar

Häftad

529 kr

Skickas inom 10-15 vardagar

Häftad

729 kr

Skickas inom 10-15 vardagar

Häftad

1 929 kr

Skickas inom 10-15 vardagar

Häftad

699 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 5-8 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

699 kr

Skickas inom 10-15 vardagar

Häftad

699 kr

Skickas inom 10-15 vardagar

Produktinformation

Utgivningsdatum1996-06-26
Mått155 x 235 x 38 mm
Vikt1 042 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor684
Upplaga1996
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540614401

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT

Saturation-based theorem proving (abstract).- Bandwidth efficient parallel computation.- Variable-length maximal codes.- Lower bounds for prepositional proofs and independence results in bounded arithmetic.- Algebraic characterizations of decorated trace equivalences over tree-like structures.- Fast asynchronous systems in dense time.- A hierarchy theorem for the ?-calculus.- An effective tableau system for the linear time ?-calculus.- Characterizing fairness implementability for multiparty interaction.- Termination of context-sensitive rewriting by rewriting.- A complete gentzen-style axiomatization for set constraints.- Fatal errors in conditional expressions.- Different types of arrow between logical frameworks.- Effective models of polymorphism, subtyping and recursion (extended abstract).- Regularity for a large class of context-free processes is decidable.- On infinite transition graphs having a decidable monadic theory.- Semi-groups acting on context-free graphs.- Hard sets method and semilinear reservoir method with applications.- Random polynomials and polynomial factorization.- Optimal gröbner base algorithms for binomial ideals.- Minimum fill-in on circle and circular-arc graphs.- Practical approximation schemes for maximum induced-subgraph problems on K 3,3-free or K 5-free graphs.- Searching a fixed graph.- Improved sampling with applications to dynamic graph algorithms.- The expressive power of existential first order sentences of büchi's sequential calculus.- Fixpoints for rabin tree automata make complementation easy.- New upper bounds to the limitedness of distance automata.- Recognizing regular expressions by means of dataflow networks.- On the power of randomized branching programs.- Hitting sets derandomize BPP.- On type-2 probabilisticquantifiers.- Speeding-up single-tape nondeterministic computations by single alternation, with separation results.- On ?-generators and codes.- On standard Sturmian morphisms.- Constructions and bounds for visual cryptography.- On capital investment.- Lower bounds for static dictionaries on RAMs with bit operations but no multiplication.- Lower bounds for row minima searching.- On the complexity of relational problems for finite state processes.- Deciding finiteness of Petri nets up to bisimulation.- Mobile processes with a distributed environment.- The meaning of negative premises in transition system specifications II.- Average case analyses of list update algorithms, with applications to data compression.- Self-organizing data structures with dependent accesses.- Lopsided trees: Analyses, algorithms, and applications.- Optimal logarithmic time randomized suffix tree construction.- Improved parallel approximation of a class of integer programming problems.- Efficient collective communication in optical networks.- Shared-memory simulations on a faulty-memory DMM.- Fast deterministic backtrack search.- Agent rendezvous: A dynamic symmetry-breaking problem.- Efficient asynchronous consensus with the value-oblivious adversary scheduler.- A formal framework for evaluating heuristic programs.- Improved scheduling algorithms for minsum criteria.- On the complexity of string folding.- A polynomial-time algorithm for near-perfect phylogeny.