Mathematical Foundations of Computer Science 1995

20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995. Proceedings

AvJiri Wiedermann,Petr Hajek

Häftad, Engelska, 1995

Del i serien Lecture Notes in Computer Science

1 136 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book presents the proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, MFCS'95, held in Prague, Czech Republic in August/September 1995.The book contains eight invited papers and two abstracts of invited talks by outstanding scientists as well as 44 revised full research papers selected from a total of 104 submissions. All relevant aspects of theoretical computer science are addressed, particularly the mathematical foundations; the papers are organized in sections on structural complexity, algorithms, complexity theory, graphs in models of computation, lower bounds, formal languages, unification, rewriting and type theory, distributed computation, concurrency, semantics, model checking, and formal calculi.

Produktinformation

Utgivningsdatum:1995-08-16
Mått:155 x 233 x 33 mm
Vikt:914 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:594
Upplaga:1995
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540602460

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

Scheduling parallel communication: The h-relation problem.- Decomposable structures, Boolean function representations, and optimization.- The complexity of interval routing on random graphs.- Bridging across the log(n) space frontier.- Second order logic and the weak exponential hierarchies.- On the computing paradigm and computational complexity.- Ranked structures in nonmonotonic reasoning and belief revision: Abstract.- Symbolic dynamics and finite automata.- Lower bounds for propositional proofs and independence results in bounded arithmetic (abstract).- Physics and the new computation.- Measure on P: Robustness of the notion.- Comparing counting classes for logspace, one-way logspace, and first-order.- Automata that take advice.- Nonuniform lower bounds for exponential time classes.- On a quantitative notion of uniformity.- Separations by random oracles and “Almost” classes for generalized reducibilities.- On the complexity of finite memory policies for Markov decision processes.- Derandomization for sparse approximations and independent sets.- Asymptotically efficient in-place merging.- The complexity of the falsifiability problem for pure implicational formulas.- Strong lower bounds on the approximability of some NPO PB-complete maximization problems.- Some typical properties of large AND/OR Boolean formulas.- The hedge: An efficient storage device for Turing machines with one head.- Graph inference from a walk for trees of bounded degree 3 is NP-complete.- Honeycomb networks.- Witness-isomorphic reductions and the local search problem (extended abstract).- Multiple product modulo arbitrary numbers.- Lower bounds for the majority communication complexity of various graph accessibility problems.- Strong optimal lower bounds for Turing machines that acceptnonregular languages.- A superpolynomial lower bound for (1,+k(n))-branching programs.- Deterministic parsing for augmented context-free grammars.- A periodicity theorem on words and applications.- A new approach to analyse Coupled-Context-Free languages.- Computational complexity of simultaneous elementary matching problems.- Graph reducibility of term rewriting systems.- Positive recursive type assignment.- String recognition on anonymous rings.- The firing squad synchronization problem on Cayley graphs.- Solving cheap graph problems on Meshes.- An elementary bisimulation decision procedure for arbitrary context-free processes.- On congruences and partial orders.- Performance preorder: Ordering processes with respect to speed.- Towards a semantic theory of CML.- Modular constructions of distributing automata.- On the proof method for bisimulation.- Towards a calculus of predicate transformers.- An abstract account of composition.- Syntax and semantics of Procol.- Synthesizing distinguishing formulae for real time systems -extended abstract.- From timed automata to logic — and back.- Incremental model checking for decomposable structures.- Automata for the modal ?-calculus and related results.- A ?-calculus with local views for systems of sequential agents.- An operator calculus approach to the evolution of dynamic data structures.

Mer från samma författare

Del 10706

SOFSEM 2018: Theory and Practice of Computer Science

A Min Tjoa, Ladjel Bellatreche, Stefan Biffl, Jan van Leeuwen, Jiří Wiedermann

Häftad, 2018

572 kr

SOFSEM 2018: Theory and Practice of Computer Science

Jiri Wiedermann, Jan van Leeuwen, Stefan Biffl, Ladjel Bellatreche, A Min Tjoa

E-bok

2018

732 kr

SOFSEM 2006: Theory and Practice of Computer Science

Jirí Wiedermann, Gerard Tel, Jaroslav Pokorný, Mária Bieliková, Július Štuller

Häftad, 2006

572 kr

SOFSEM 2006: Theory and Practice of Computer Science

Julius Stuller, Maria Bielikova, Jaroslav Pokorny, Gerard Tel, Jiri Wiedermann

E-bok

2005

739 kr

SOFSEM 2000: Theory and Practice of Informatics

Vaclav Hlavac, Keith G. Jeffery, Jiri Wiedermann

Häftad, 2000

571 kr

SOFSEM 2000: Theory and Practice of Informatics

Jiri Wiedermann, Keith G. Jeffery, Vaclav Hlavac

E-bok

2003

739 kr

Automata, Languages and Programming

Mogens Nielsen, Peter van Emde Boas, Jiri Wiedermann

E-bok

2003

1 470 kr

SOFSEM '95: Theory and Practice of Informatics

Miroslav Bartosek, Jan Staudek, Jiri Wiedermann

Häftad, 1995

572 kr

Automata, Languages and Programming

Jiri Wiedermann, Peter van Emde Boas, Mogens Nielsen

Häftad, 1999

1 136 kr

Mer från samma serie

Multiobjective Optimization

Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Roman Slowiński

Häftad, 2008

555 kr

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang - Knowledge Graphs, Häftad

Del 16297

Knowledge Graphs

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang

Häftad, 2026

933 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

572 kr

Del 16096

Energy Informatics

Ivo Martinac, Bo Nørregaard Jørgensen, Zheng Grace Ma, Rúnar Unnþórsson, Chiara Bordin

Häftad, 2025

842 kr

Alejandro Jiménez Rodríguez, Rafael Mestre, Chaona Chen, Anna Mura, Edmund Barker, Paul Verschure, Tony Prescott - Biomimetic and Biohybrid Systems, Häftad

Del 15582

Biomimetic and Biohybrid Systems

Alejandro Jiménez Rodríguez, Rafael Mestre, Chaona Chen, Anna Mura, Edmund Barker, Paul Verschure, Tony Prescott

Häftad, 2025

1 022 kr

Extended Reality

Lucio Tommaso De Paolis, Pasquale Arpaia, Marco Sacco

Häftad, 2026

1 164 kr

Reliable Software Technologies - Ada-Europe '98

Lars Asplund

Häftad, 1998

572 kr

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson - Advanced Parallel Processing Technologies, Häftad

Nyhet

Del 16693

Advanced Parallel Processing Technologies

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson

Häftad, 2026

1 024 kr

Del 16832

Progress in Cryptology - AFRICACRYPT 2026

Nadia El Mrabet, Loubna Ghammam, Francisco Rodríguez-Henríquez

Häftad, 2026

933 kr

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek - Electronic Participation, Häftad

Nyhet

Electronic Participation

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek

Häftad, 2026

730 kr

Du kanske också är intresserad av

Pokémon Pokémon Mega Evolution 05 - Pitch Black Booster

Pokémon

79 kr

Parallel Computing Technologies

Victor Malyshkin

Häftad, 1995

572 kr

SOFSEM '95: Theory and Practice of Informatics

Miroslav Bartosek, Jan Staudek, Jiri Wiedermann

Häftad, 1995

572 kr

Norm Estimations for Operator Valued Functions and Their Applications

Michael Gil

Inbunden, 1995

3 008 kr

Participatory Evaluation In Education

Lorna M. Earl, J. Bradley Cousins

Häftad, 1995

784 kr

Die Leistungs-Programmerweiterung Der Postbank: Ökonomische Aspekte Der Einführung Zusätzlicher Bankdienstleistungen

Deutscher Universitatsverlag

Häftad, 1995

534 kr

Dienstleistungspolitik Industrieller Unternehmen: Sekundärdienstleistungen ALS Marketinginstrument Bei Gebrauchsgütern

Deutscher Universitatsverlag

Häftad, 1995

534 kr

Water Quality Data

Arthur Hounslow

Inbunden, 1995

4 151 kr

Indoor Air Quality

T. Lindvall, B. Seifert, M. Maroni

E-bok

1995

4 592 kr

Strategie Und Personal: Ansätze Zur Personalorientierung Der Strategischen Unternehmensführung

Deutscher Universitatsverlag

Häftad, 1995

534 kr

Mathematical Foundations of Computer Science 1995

20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995. Proceedings

AvJiri Wiedermann,Petr Hajek

Häftad, Engelska, 1995

Del i serien Lecture Notes in Computer Science

1 136 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

Produktinformation

Utgivningsdatum:1995-08-16
Mått:155 x 233 x 33 mm
Vikt:914 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:594
Upplaga:1995
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540602460

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Innehållsförteckning

Scheduling parallel communication: The h-relation problem.- Decomposable structures, Boolean function representations, and optimization.- The complexity of interval routing on random graphs.- Bridging across the log(n) space frontier.- Second order logic and the weak exponential hierarchies.- On the computing paradigm and computational complexity.- Ranked structures in nonmonotonic reasoning and belief revision: Abstract.- Symbolic dynamics and finite automata.- Lower bounds for propositional proofs and independence results in bounded arithmetic (abstract).- Physics and the new computation.- Measure on P: Robustness of the notion.- Comparing counting classes for logspace, one-way logspace, and first-order.- Automata that take advice.- Nonuniform lower bounds for exponential time classes.- On a quantitative notion of uniformity.- Separations by random oracles and “Almost” classes for generalized reducibilities.- On the complexity of finite memory policies for Markov decision processes.- Derandomization for sparse approximations and independent sets.- Asymptotically efficient in-place merging.- The complexity of the falsifiability problem for pure implicational formulas.- Strong lower bounds on the approximability of some NPO PB-complete maximization problems.- Some typical properties of large AND/OR Boolean formulas.- The hedge: An efficient storage device for Turing machines with one head.- Graph inference from a walk for trees of bounded degree 3 is NP-complete.- Honeycomb networks.- Witness-isomorphic reductions and the local search problem (extended abstract).- Multiple product modulo arbitrary numbers.- Lower bounds for the majority communication complexity of various graph accessibility problems.- Strong optimal lower bounds for Turing machines that acceptnonregular languages.- A superpolynomial lower bound for (1,+k(n))-branching programs.- Deterministic parsing for augmented context-free grammars.- A periodicity theorem on words and applications.- A new approach to analyse Coupled-Context-Free languages.- Computational complexity of simultaneous elementary matching problems.- Graph reducibility of term rewriting systems.- Positive recursive type assignment.- String recognition on anonymous rings.- The firing squad synchronization problem on Cayley graphs.- Solving cheap graph problems on Meshes.- An elementary bisimulation decision procedure for arbitrary context-free processes.- On congruences and partial orders.- Performance preorder: Ordering processes with respect to speed.- Towards a semantic theory of CML.- Modular constructions of distributing automata.- On the proof method for bisimulation.- Towards a calculus of predicate transformers.- An abstract account of composition.- Syntax and semantics of Procol.- Synthesizing distinguishing formulae for real time systems -extended abstract.- From timed automata to logic — and back.- Incremental model checking for decomposable structures.- Automata for the modal ?-calculus and related results.- A ?-calculus with local views for systems of sequential agents.- An operator calculus approach to the evolution of dynamic data structures.

Mer från samma författare

Del 10706

SOFSEM 2018: Theory and Practice of Computer Science

A Min Tjoa, Ladjel Bellatreche, Stefan Biffl, Jan van Leeuwen, Jiří Wiedermann

Häftad, 2018

572 kr

SOFSEM 2018: Theory and Practice of Computer Science

Jiri Wiedermann, Jan van Leeuwen, Stefan Biffl, Ladjel Bellatreche, A Min Tjoa

E-bok

2018

732 kr

SOFSEM 2006: Theory and Practice of Computer Science

Jirí Wiedermann, Gerard Tel, Jaroslav Pokorný, Mária Bieliková, Július Štuller

Häftad, 2006

572 kr

SOFSEM 2006: Theory and Practice of Computer Science

Julius Stuller, Maria Bielikova, Jaroslav Pokorny, Gerard Tel, Jiri Wiedermann

E-bok

2005

739 kr

SOFSEM 2000: Theory and Practice of Informatics

Vaclav Hlavac, Keith G. Jeffery, Jiri Wiedermann

Häftad, 2000

571 kr

SOFSEM 2000: Theory and Practice of Informatics

Jiri Wiedermann, Keith G. Jeffery, Vaclav Hlavac

E-bok

2003

739 kr

Automata, Languages and Programming

Mogens Nielsen, Peter van Emde Boas, Jiri Wiedermann

E-bok

2003

1 470 kr

SOFSEM '95: Theory and Practice of Informatics

Miroslav Bartosek, Jan Staudek, Jiri Wiedermann

Häftad, 1995

572 kr

Automata, Languages and Programming

Jiri Wiedermann, Peter van Emde Boas, Mogens Nielsen

Häftad, 1999

1 136 kr

Mer från samma serie

Multiobjective Optimization

Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Roman Slowiński

Häftad, 2008

555 kr

Del 16297

Knowledge Graphs

Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang

Häftad, 2026

933 kr

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

572 kr

Del 16096

Energy Informatics

Ivo Martinac, Bo Nørregaard Jørgensen, Zheng Grace Ma, Rúnar Unnþórsson, Chiara Bordin

Häftad, 2025

842 kr

Del 15582

Biomimetic and Biohybrid Systems

Alejandro Jiménez Rodríguez, Rafael Mestre, Chaona Chen, Anna Mura, Edmund Barker, Paul Verschure, Tony Prescott

Häftad, 2025

1 022 kr

Extended Reality

Lucio Tommaso De Paolis, Pasquale Arpaia, Marco Sacco

Häftad, 2026

1 164 kr

Reliable Software Technologies - Ada-Europe '98

Lars Asplund

Häftad, 1998

572 kr

Nyhet

Del 16693

Advanced Parallel Processing Technologies

Lieven Eeckhout, Chao Li, Zhibin Yu, Avi Mendelson

Häftad, 2026

1 024 kr

Del 16832

Progress in Cryptology - AFRICACRYPT 2026

Nadia El Mrabet, Loubna Ghammam, Francisco Rodríguez-Henríquez

Häftad, 2026

933 kr

Nyhet

Electronic Participation

David Duenas-Cid, Gregor Eibl, Lieselot Danneels, Michael Koddebusch, Edimara Mezzomo Luciano, Gianluca Carlo Misuraca, Gerhard Schwabe, Teta Stamati, Leif Sundberg, Peter Parycek

Häftad, 2026

730 kr