Search results for "MFCS"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Arnaud Durand 0001, Miki Hermann, Phokion G. Kolaitis	Subtractive Reductions and Complete Problems for Counting Complexity Classes.	MFCS	2000	DBLP DOI BibTeX RDF
1	Miki Tanaka	Abstract Syntax and Variable Binding for Linear Binders.	MFCS	2000	DBLP DOI BibTeX RDF
1	Jan van Leeuwen, Jirí Wiedermann	On Algorithms and Interaction.	MFCS	2000	DBLP DOI BibTeX RDF
1	Søren B. Lassen, Andrew Moran	Unique Fixed Point Induction for McCarthy's Amb.	MFCS	1999	DBLP DOI BibTeX RDF
1	Markus Lohrey	Complexity Results for Confluence Problems.	MFCS	1999	DBLP DOI BibTeX RDF
1	Xizhong Zheng, Klaus Weihrauch	The Arithmetical Hierarchy of Real Numbers.	MFCS	1999	DBLP DOI BibTeX RDF	Recursively Approximable Real Number, Real Numbers, Arithmetical Hierarchy
1	Jerzy Tiuryn	Type Reconstruction for Functional Programs with Subtyping over a Lattice of Atomic Types.	MFCS	1999	DBLP DOI BibTeX RDF
1	Henning Fernau, Rolf Niedermeier	An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover.	MFCS	1999	DBLP DOI BibTeX RDF
1	Ulrich Hertrampf	Generalized Regular Counting Classes.	MFCS	1999	DBLP DOI BibTeX RDF
1	Hardi Hungar	Model Checking and Higher-Order Recursion.	MFCS	1999	DBLP DOI BibTeX RDF
1	Sibylle B. Fröschle, Thomas T. Hildebrandt	On Plain and Hereditary History-Preserving Bisimulation.	MFCS	1999	DBLP DOI BibTeX RDF
1	Ján Manuch	Multiparty Communication Complexity: Very Hard Functions.	MFCS	1999	DBLP DOI BibTeX RDF
1	Peter D. Mosses	Foundations of Modular SOS.	MFCS	1999	DBLP DOI BibTeX RDF
1	Frank S. de Boer, Willem P. de Roever, Ulrich Hannemann	The Semantic Foundations of a Compositional Proof Method for Synchronously Communicating Processes.	MFCS	1999	DBLP DOI BibTeX RDF
1	Maurice Herlihy, Sergio Rajsbaum	New Perspectives in Distributed Computing.	MFCS	1999	DBLP DOI BibTeX RDF
1	Leszek Gasieniec, Alan Gibbons, Wojciech Rytter	Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts.	MFCS	1999	DBLP DOI BibTeX RDF
1	Philipp Woelfel	Efficient Strongly Universal and Optimally Universal Hashing.	MFCS	1999	DBLP DOI BibTeX RDF
1	Cyril Nicaud	Average State Complexity of Operations on Unary Automata.	MFCS	1999	DBLP DOI BibTeX RDF
1	Christiane Frougny	On-Line Addition in Real Base.	MFCS	1999	DBLP DOI BibTeX RDF
1	Yann Loyer, Nicolas Spyratos, Daniel Stamate	Computing and Comparing Semantics of Programs in Four-Valued Logics.	MFCS	1999	DBLP DOI BibTeX RDF	logic programming, inconsistency, logics of knowledge, Four-valued logics
1	Luciano Margara	On Some Topological Properties of Linear Cellular Automata.	MFCS	1999	DBLP DOI BibTeX RDF	cellular automaton, chaos theory, discrete time dynamical system
1	Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki	On Minimum Edge Ranking Spanning Trees.	MFCS	1999	DBLP DOI BibTeX RDF
1	Luca Aceto, François Laroussinie	Is Your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics.	MFCS	1999	DBLP DOI BibTeX RDF
1	Holger Petersen 0001	Fooling Rebound Automata.	MFCS	1999	DBLP DOI BibTeX RDF
1	Alexander Bolotov, Clare Dixon, Michael Fisher 0001	Clausal Resolution for CTL*.	MFCS	1999	DBLP DOI BibTeX RDF
1	Wlodzimierz Glazek	Lower and Upper Bounds for the Problem of Page Replication in Ring Networks.	MFCS	1999	DBLP DOI BibTeX RDF
1	Tomoyuki Yamakami	A Foundation of Programming a Multi-tape Quantum Turing Machine.	MFCS	1999	DBLP DOI BibTeX RDF
1	Detlef Sieling	The Complexity of Minimizing FBDDs.	MFCS	1999	DBLP DOI BibTeX RDF
1	David Janin, Giacomo Lenzi	On the Structure of the Monadic Logic of the Binary Tree.	MFCS	1999	DBLP DOI BibTeX RDF
1	Giovanni Manzini	Invited Lecture: The Burrows-Wheeler Transform: Theory and Practice.	MFCS	1999	DBLP DOI BibTeX RDF
1	Katsuhiko Nakamura	Real-Time Language Recognition by One-Way and Two-Way Cellular Automata.	MFCS	1999	DBLP DOI BibTeX RDF	one-way cellular automata, parallel language recognition, closure under reversal, Cellular automata
1	Grzegorz Grudzinski	An Improved Disjunctive Strictness Analysis for Lazy Functional Languages.	MFCS	1999	DBLP DOI BibTeX RDF
1	Anca Muscholl, Doron A. Peled	Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces.	MFCS	1999	DBLP DOI BibTeX RDF	Message sequence graphs, Mazurkiewicz semi-traces, universality problem, automata theory
1	Mads Tofte	A Type Discipline for Solving Year 2000 Problems in COBOL Programs.	MFCS	1999	DBLP DOI BibTeX RDF
1	Arnaud Durand 0001, Miki Hermann, Laurent Juban	On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System.	MFCS	1999	DBLP DOI BibTeX RDF
1	Anna Gambin	On Approximating the Number of Bases of Exchange Preserving Matroids.	MFCS	1999	DBLP DOI BibTeX RDF
1	George Havas, Jean-Pierre Seifert	The Complexity of the Extended GCD Problem.	MFCS	1999	DBLP DOI BibTeX RDF	computational problems of diophantine equations, extended gcd computations, Approximation algorithms, NP-hardness, probabilistically checkable proofs, interactive proof systems
1	Dexter Kozen	Language-Based Security.	MFCS	1999	DBLP DOI BibTeX RDF
1	Klaus Meer	Query Languages for Real Number Databases Based on Descriptive Complexity over R.	MFCS	1999	DBLP DOI BibTeX RDF
1	Janis Cirulis	An Algebraic Approach to Knowledge Representation.	MFCS	1999	DBLP DOI BibTeX RDF
1	Linh Anh Nguyen	A New Space Bound for the Modal Logics K4, KD4 and S4.	MFCS	1999	DBLP DOI BibTeX RDF
1	Thorsten Bernholt, Alexander Gülich, Thomas Hofmeister, Niels Schmitt	Football Elimination Is Hard to Decide Under the 3-Point-Rule.	MFCS	1999	DBLP DOI BibTeX RDF
1	Miroslaw Kutylowski, Leszek Pacholski, Tomasz Wierzbicki (eds.)	Mathematical Foundations of Computer Science 1999, 24th International Symposium, MFCS'99, Szklarska Poreba, Poland, September 6-10, 1999, Proceedings	MFCS	1999	DBLP DOI BibTeX RDF
1	Jitka Stríbrná	Approximating Weak Bisimulation on Basic Process Algebras.	MFCS	1999	DBLP DOI BibTeX RDF
1	Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano	Edge Coloring of Bipartite Graphs with Constraints.	MFCS	1999	DBLP DOI BibTeX RDF
1	Jacek Chrzaszcz	Polymorphic Subtyping Without Distributivity.	MFCS	1998	DBLP DOI BibTeX RDF
1	Miki Hermann, Gernot Salzer	On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations.	MFCS	1998	DBLP DOI BibTeX RDF
1	Géraud Sénizergues	The Equivalence Problem for Deterministic Pushdown Transducers into Abelian Groups.	MFCS	1998	DBLP DOI BibTeX RDF
1	Martin Große-Rhode, Francesco Parisi-Presicce, Marta Simeoni	Spatial and Temporal Refinement of Typed Graph Transformation Systems.	MFCS	1998	DBLP DOI BibTeX RDF
1	Flemming Nielson, Hanne Riis Nielson	Flow Logic for Imperative Objects.	MFCS	1998	DBLP DOI BibTeX RDF
1	Martin Grohe, Thomas Schwentick	Locality of Order-Invariant First-Order Formulas.	MFCS	1998	DBLP DOI BibTeX RDF
1	Thomas Buchholz, Andreas Klein 0001, Martin Kutrib	One Guess One-Way Cellular Arrays.	MFCS	1998	DBLP DOI BibTeX RDF
1	Roberto Giacobazzi, Francesco Ranzato, Francesca Scozzari	Complete Abstract Interpretations Made Constructive.	MFCS	1998	DBLP DOI BibTeX RDF
1	Lubos Brim, Jozef Gruska, Jirí Zlatuska (eds.)	Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings	MFCS	1998	DBLP DOI BibTeX RDF
1	Levke Bentzien	Positive Turing and Truth-Table Completeness for NEXP Are Incomparable.	MFCS	1998	DBLP DOI BibTeX RDF
1	Andris Ambainis, David A. Mix Barrington, Huong LeThanh	On Counting AC0 Circuits with Negative Constants.	MFCS	1998	DBLP DOI BibTeX RDF
1	David Harel	Towards a Theory of Recursive Structures.	MFCS	1998	DBLP DOI BibTeX RDF
1	Wolfgang Maass 0001	On the Role of Time and Space in Neural Computation.	MFCS	1998	DBLP DOI BibTeX RDF
1	Mikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo	Combinatorial Hardness Proofs for Polynomial Evaluation.	MFCS	1998	DBLP DOI BibTeX RDF
1	Pawel Mielniczuk, Leszek Pacholski	Tarskian Set Constraints Are in NEXPTIME.	MFCS	1998	DBLP DOI BibTeX RDF
1	Jirí Srba	Deadlocking States in Context-Free Process Algebra.	MFCS	1998	DBLP DOI BibTeX RDF
1	Gilles Barthe	The Semi-Full Closure of Pure Type Systems.	MFCS	1998	DBLP DOI BibTeX RDF
1	Thomas Hofmeister, Hanno Lefmann	Approximating Maximum Independent Sets in Uniform Hypergraphs.	MFCS	1998	DBLP DOI BibTeX RDF
1	Klaus Ambos-Spies, Steffen Lempp, Gunther Mainhardt	Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets.	MFCS	1998	DBLP DOI BibTeX RDF
1	Luis-Miguel Lopez, Philippe Narbel	D0L-Systems and Surface Automorphisms.	MFCS	1998	DBLP DOI BibTeX RDF
1	Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra	Degree-Preserving Forests.	MFCS	1998	DBLP DOI BibTeX RDF
1	Klaus Reinhardt	On Some Recognizable Picture-Languages.	MFCS	1998	DBLP DOI BibTeX RDF
1	Anna Slobodová	On the Composition Problem for OBDDs with Multiple Variable Orders.	MFCS	1998	DBLP DOI BibTeX RDF
1	Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller, Helmut Veith	Proof Theory of Fuzzy Logics: Urquhart's C and Related Logics.	MFCS	1998	DBLP DOI BibTeX RDF
1	Bruno Courcelle, Denis Lapoire	Facial Circuits of Planar Graphs and Context-Free Languages.	MFCS	1998	DBLP DOI BibTeX RDF
1	Carsten Damm	On Boolean vs. Modular Arithmetic for Circuits and Communication Protocols.	MFCS	1998	DBLP DOI BibTeX RDF
1	Henning Fernau, Ludwig Staiger	IFS and Control Languages.	MFCS	1998	DBLP DOI BibTeX RDF
1	Giovanni Manzini	Characterization of Sensitive Linear Cellular Automata with Respect to the Counting Distance.	MFCS	1998	DBLP DOI BibTeX RDF
1	Hélène Touzet	Encoding the Hydra Battle as a Rewrite System.	MFCS	1998	DBLP DOI BibTeX RDF
1	Oliver Matz	One Quantifier Will Do in Existential Monadic Second-Order Logic over Pictures.	MFCS	1998	DBLP DOI BibTeX RDF
1	Yonit Kesten, Amir Pnueli	Modularization and Abstraction: The Keys to Practical Formal Verification.	MFCS	1998	DBLP DOI BibTeX RDF
1	Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe	Tally NP Sets and Easy Census Functions.	MFCS	1998	DBLP DOI BibTeX RDF
1	Sergei L. Bezrukov, Joe D. Chavez, L. H. Harper, Markus Röttger, Ulf-Peter Schroeder	Embedding of Hypercubes into Grids.	MFCS	1998	DBLP DOI BibTeX RDF
1	Juhani Karhumäki, Ján Manuch, Wojciech Plandowski	On Defect Effect of Bi-Infinite Words.	MFCS	1998	DBLP DOI BibTeX RDF
1	Pavel Pudlák	Satisfiability - Algorithms and Logic.	MFCS	1998	DBLP DOI BibTeX RDF
1	Christian Choffrut, Sándor Horváth	Equations in Transfinite Strings.	MFCS	1998	DBLP DOI BibTeX RDF
1	Kazuyuki Amano, Akira Maruoka	A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with At Most (1/6) log log n Negation Gates.	MFCS	1998	DBLP DOI BibTeX RDF
1	Maria C. F. Ferreira, Delia Kesner, Laurence Puel	Reducing AC-Termination to Termination.	MFCS	1998	DBLP DOI BibTeX RDF
1	Marcin Benke	Predicative Polymorphic Subtyping.	MFCS	1998	DBLP DOI BibTeX RDF
1	Paul Gastin, Raphaël Meyer, Antoine Petit 0001	A (Non-elementary) Modular Decision Procedure for LTrL.	MFCS	1998	DBLP DOI BibTeX RDF
1	Zoltán Fülöp 0001, Eija Jurvanen, Magnus Steinby, Sándor Vágvölgyi	On One-Pass Term Rewriting.	MFCS	1998	DBLP DOI BibTeX RDF
1	Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi	Minimum Propositional Proof Length is NP-Hard to Linearly Approximate.	MFCS	1998	DBLP DOI BibTeX RDF
1	Christian Hagenah, Anca Muscholl	Computing epsilon-Free NFA from Regular Expressions in O(n log²(n)) Time.	MFCS	1998	DBLP DOI BibTeX RDF
1	Egon Börger, Wolfram Schulte	Defining the Java Virtual Machine as Platform for Provably Correct Java Compilation.	MFCS	1998	DBLP DOI BibTeX RDF
1	Tero Harju, Alexandru Mateescu, Arto Salomaa	Shuffle on Trajectories: The Schützenberger Product and Related Operations.	MFCS	1998	DBLP DOI BibTeX RDF
1	Johannes Köbler, Rainer Schuler	Average-Case Intractability vs. Worst-Case Intractability.	MFCS	1998	DBLP DOI BibTeX RDF
1	Kazuo Iwama, Mitsushi Nouzoe, Shuzo Yajima	Optimizing OBDDs Is Still Intractable for Monotone Functions.	MFCS	1998	DBLP DOI BibTeX RDF	NP-completeness, Ordered Binary Decision Diagrams, Monotone Functions
1	Isabelle Ryl, Yves Roos, Mireille Clerbout	About Synchronization Languages.	MFCS	1998	DBLP DOI BibTeX RDF
1	Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer 0001, Peter Sanders 0001	A Parallelization of Dijkstra's Shortest Path Algorithm.	MFCS	1998	DBLP DOI BibTeX RDF
1	Sergei G. Vorobyov	forall exists*-Equational Theory of Context Unification is Pi10-Hard.	MFCS	1998	DBLP DOI BibTeX RDF
1	Gavin M. Bierman	A Computational Interpretation of the lambda-µ-Calculus.	MFCS	1998	DBLP DOI BibTeX RDF
1	Klaus Barthelmann	When Can an Equational Simple Graph Be Generated by Hyperedge Replacement?	MFCS	1998	DBLP DOI BibTeX RDF
1	Gianpiero Cattaneo, Luciano Margara	Topological Definitions of Chaos Applied to Cellular Automata Dynamics.	MFCS	1998	DBLP DOI BibTeX RDF
1	Jacques Mazoyer, Ivan Rapaport	Additive Cellular Automata over Zp and the Bottom of (CA, <=).	MFCS	1998	DBLP DOI BibTeX RDF
1	Silvio Micali	Computationally-Sound Checkers.	MFCS	1998	DBLP DOI BibTeX RDF

Publications at "MFCS"( http://dblp.L3S.de/Venues/MFCS )