Search results for "MFCS"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Paul Gastin, Madhavan Mukund, K. Narayan Kumar	Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces.	MFCS	2003	DBLP DOI BibTeX RDF	concurrency, Temporal logics, Mazurkiewicz traces
1	Víctor Dalmau, Daniel K. Ford	Generalized Satisfability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity.	MFCS	2003	DBLP DOI BibTeX RDF
1	Olivier Carton	Unambiguous Automata on Bi-infinite Words.	MFCS	2003	DBLP DOI BibTeX RDF
1	Michele Boreale, Maria Grazia Buscemi	Symbolic Analysis of Crypto-Protocols Based on Modular Exponentiation.	MFCS	2003	DBLP DOI BibTeX RDF
1	Harry Buhrman, Hein Röhrig	Distributed Quantum Computing.	MFCS	2003	DBLP DOI BibTeX RDF
1	Katalin Friedl, Frédéric Magniez, Miklos Santha, Pranab Sen	Quantum Testers for Hidden Group Properties.	MFCS	2003	DBLP DOI BibTeX RDF
1	Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter	Faster Algorithms for k-Medians in Trees.	MFCS	2003	DBLP DOI BibTeX RDF
1	Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu, Gaurav Saxena	Characterizations of Catalytic Membrane Computing Systems.	MFCS	2003	DBLP DOI BibTeX RDF	catalytic system, vector addition system, reachability problem, membrane computing, semilinear set
1	Steffen Reith	On the Complexity of Some Equivalence Problems for Propositional Calculi.	MFCS	2003	DBLP DOI BibTeX RDF	Boolean isomorphism, Boolean equivalence, closed classes, Computational complexity, Boolean functions, satisfiability problems, Dichotomy, Post
1	Paul S. Bonsma, Tobias Brüggemann, Gerhard J. Woeginger	A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves.	MFCS	2003	DBLP DOI BibTeX RDF
1	Alfons Geser, Dieter Hofbauer, Johannes Waldmann	Match-Bounded String Rewriting Systems.	MFCS	2003	DBLP DOI BibTeX RDF
1	Kensuke Baba, Satoshi Tsuruta, Ayumi Shinohara, Masayuki Takeda	On the Length of the Minimum Solution of Word Equations in One Variable.	MFCS	2003	DBLP DOI BibTeX RDF
1	Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre	Linear-Time Computation of Local Periods.	MFCS	2003	DBLP DOI BibTeX RDF
1	Xizhong Zheng, Robert Rettinger, Romain Gengler	Ershov's Hierarchy of Real Numbers.	MFCS	2003	DBLP DOI BibTeX RDF
1	Toshimasa Ishii, Masayuki Hagiwara	Augmenting Local Edge-Conncectivity between Vertices and Vertex Subsets in Undirected Graphs.	MFCS	2003	DBLP DOI BibTeX RDF
1	Paul Gastin, Denis Oddoux	LTL with Past and Two-Way Very-Weak Alternating Automata.	MFCS	2003	DBLP DOI BibTeX RDF
1	Klaus Ambos-Spies	Problems with Cannot Be Reduced to Any Proper Subproblems.	MFCS	2003	DBLP DOI BibTeX RDF
1	Piotr Krysta, Peter Sanders 0001, Berthold Vöcking	Scheduling and Traffic Allocation for Tasks with Bounded Splittability.	MFCS	2003	DBLP DOI BibTeX RDF
1	Petr Hlinený	On Matroid Properties Definable in the MSO Logic.	MFCS	2003	DBLP DOI BibTeX RDF	MSO logic, parametrized complexity, matroid, branch-width
1	Henrik Brosenne, Matthias Homeister, Stephan Waack	Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs.	MFCS	2003	DBLP DOI BibTeX RDF
1	Kazuyuki Amano, Akira Maruoka	On Optimal Merging Networks.	MFCS	2003	DBLP DOI BibTeX RDF
1	Didier Caucal, Teodor Knapik	A Chomsky-Like Hierarchy of Infinite Graphs.	MFCS	2002	DBLP DOI BibTeX RDF
1	Mika Hirvensalo, Juhani Karhumäki	Computing Partial Information out of Intractable One - The First Digit of 2 n at Base 3 as an Example.	MFCS	2002	DBLP DOI BibTeX RDF
1	Wolfgang Merkle, Nenad Mihailovic	On the Construction of Effective Random Sets.	MFCS	2002	DBLP DOI BibTeX RDF
1	Robert Dabrowski, Wojciech Plandowski	On Word Equations in One Variable.	MFCS	2002	DBLP DOI BibTeX RDF
1	Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park	Fast Algorithms with Algebraic Monge Properties.	MFCS	2002	DBLP DOI BibTeX RDF
1	Todd Ebert, Wolfgang Merkle	Autoreducibility of Random Sets: A Sharp Bound on the Density of Guessed Bits.	MFCS	2002	DBLP DOI BibTeX RDF
1	David Peleg	Low Stretch Spanning Trees.	MFCS	2002	DBLP DOI BibTeX RDF
1	Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong	Competitive Analysis of On-line Stream Merging Algorithms.	MFCS	2002	DBLP DOI BibTeX RDF
1	Antonín Kucera 0001, Richard Mayr	On the Complexity of Semantic Equivalences for Pushdown Automata and BPA.	MFCS	2002	DBLP DOI BibTeX RDF
1	Jan Johannsen, N. S. Narayanaswamy	An Optimal Lower Bound for Resolution with 2-Conjunctions.	MFCS	2002	DBLP DOI BibTeX RDF
1	Ola Angelsmark, Vilhelm Dahllöf, Peter Jonsson	Finite Domain Constraint Satisfaction Using Quantum Computation.	MFCS	2002	DBLP DOI BibTeX RDF
1	Iyad A. Kanj, Ljubomir Perkovic	Improved Parameterized Algorithms for Planar Dominating Set.	MFCS	2002	DBLP DOI BibTeX RDF	planar dominating set, NP-complete problems, parameterized algorithms
1	Richard Groult, Martine Léonard, Laurent Mouchard	Evolutive Tandem Repeats Using Hamming Distance.	MFCS	2002	DBLP DOI BibTeX RDF
1	Mihalis Beis, William Duckworth, Michele Zito 0001	Packing Edges in Random Regular Graphs.	MFCS	2002	DBLP DOI BibTeX RDF
1	Mohammad Taghi Hajiaghayi, Naomi Nishimura	Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth.	MFCS	2002	DBLP DOI BibTeX RDF
1	Beate Bollig, Philipp Woelfel	A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications.	MFCS	2002	DBLP DOI BibTeX RDF
1	Fabio Martinelli	Symbolic Semantics and Analysis for Crypto-CCS with (Almost) Generic Inference Systems.	MFCS	2002	DBLP DOI BibTeX RDF
1	Jochen Messner	On the Structure of the Simulation Order of Proof Systems.	MFCS	2002	DBLP DOI BibTeX RDF
1	Ondrej Klíma 0001	Unification Modulo Associativity and Idempotency Is NP-complete.	MFCS	2002	DBLP DOI BibTeX RDF	idempotent semigroups, complexity, unification
1	Thomas Lücking 0001, Burkhard Monien, Manuel Rode	On the Problem of Scheduling Flows on Distributed Networks.	MFCS	2002	DBLP DOI BibTeX RDF
1	Sylvain Lombardy, Jacques Sakarovitch	Derivation of Rational Expressions with Multiplicity.	MFCS	2002	DBLP DOI BibTeX RDF
1	Lucian Ilie, Sheng Yu 0001	Algorithms for Computing Small NFAs.	MFCS	2002	DBLP DOI BibTeX RDF	follow relations, invariant equivalences, algorithms, regular expressions, positions, partial derivatives, quotients, nondeterministic finite automata
1	Leah Epstein, Lene M. Favrholdt	Optimal Non-preemptive Semi-online Scheduling on Two Related Machines.	MFCS	2002	DBLP DOI BibTeX RDF
1	Leah Epstein, Csanád Imreh, Rob van Stee	More on Weighted Servers or FIFO is Better than LRU.	MFCS	2002	DBLP DOI BibTeX RDF
1	Marek Karpinski	Approximability of the Minimum Bisection Problem: An Algorithmic Challenge.	MFCS	2002	DBLP DOI BibTeX RDF
1	Juhani Karhumäki	Applications of Finite Automata.	MFCS	2002	DBLP DOI BibTeX RDF
1	Yann Loyer, Nicolas Spyratos	Hypothesis-Founded Semantics for Datalog Programs with Negation.	MFCS	2002	DBLP DOI BibTeX RDF	semantics of logic programs, non-monotonic reasoning, hypothesis
1	Till Tantau	Towards a Cardinality Theorem for Finite Automata.	MFCS	2002	DBLP DOI BibTeX RDF
1	Patrícia D. L. Machado, Donald Sannella	Unit Testing for CASL Architectural Specifications.	MFCS	2002	DBLP DOI BibTeX RDF
1	Michel Rigo	Characterizing Simpler Recognizable Sets of Integers.	MFCS	2002	DBLP DOI BibTeX RDF
1	Till Mossakowski	Comorphism-Based Grothendieck Logics.	MFCS	2002	DBLP DOI BibTeX RDF
1	Gwénaël Richomme, Francis Wlazinski	Finite Test-Sets for Overlap-Free Morphisms.	MFCS	2002	DBLP DOI BibTeX RDF	overlap-free words, test-sets, Combinatorics on words, morphisms
1	Catherine McCartin	Parameterized Counting Problems.	MFCS	2002	DBLP DOI BibTeX RDF
1	Ryszard Janicki	On a Mereological System for Relational Software Specifications.	MFCS	2002	DBLP DOI BibTeX RDF
1	Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa	Space-Economical Construction of Index Structures for All Suffixes of a String.	MFCS	2002	DBLP DOI BibTeX RDF
1	Alan Gibbons, Paul Sant	Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the Four-Colour Theorem of Planar Maps.	MFCS	2002	DBLP DOI BibTeX RDF
1	Jan Kára, Daniel Král	Optimal Free Binary Decision Diagrams for Computation of EARn.	MFCS	2002	DBLP DOI BibTeX RDF
1	Andreas Goerdt, Tomasz Jurdzinski	Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures.	MFCS	2002	DBLP DOI BibTeX RDF
1	Joost Engelfriet, Sebastian Maneth	Two-Way Finite State Transducers with Nested Pebbles.	MFCS	2002	DBLP DOI BibTeX RDF
1	Krzysztof Diks, Wojciech Rytter (eds.)	Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings	MFCS	2002	DBLP DOI BibTeX RDF
1	Amin Coja-Oghlan	Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming.	MFCS	2002	DBLP DOI BibTeX RDF
1	Maria I. Andreou, Dimitris Fotakis 0001, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis	On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness and Approximations.	MFCS	2002	DBLP DOI BibTeX RDF
1	Michel Bidoit, Donald Sannella, Andrzej Tarlecki	Global Development via Local Observational Construction Steps.	MFCS	2002	DBLP DOI BibTeX RDF
1	Yaw-Ling Lin, Tao Jiang 0001, Kun-Mao Chao	Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis.	MFCS	2002	DBLP DOI BibTeX RDF	maximum consecutive subsequence, length constraint, biomolecular sequence analysis, ungapped local alignment, Algorithm, efficiency
1	Chuzo Iwamoto, Takeshi Andou, Kenichi Morita, Katsunobu Imai	Computational Complexity in the Hyperbolic Plane.	MFCS	2002	DBLP DOI BibTeX RDF	complexity, cellular automata, hyperbolic geometry
1	Orna Kupferman, Sharon Zuhovitzky	An Improved Algorithm for the Membership Problem for Extended Regular Expressions.	MFCS	2002	DBLP DOI BibTeX RDF
1	Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan	Matroid Intersections, Polymatroid Inequalities, and Related Problems.	MFCS	2002	DBLP DOI BibTeX RDF
1	Dániel Marx	The Complexity of Tree Multicolorings.	MFCS	2002	DBLP DOI BibTeX RDF
1	Kazuo Iwama, Hiroki Morizumi	An Explicit Lower Bound of 5n - o(n) for Boolean Circuits.	MFCS	2002	DBLP DOI BibTeX RDF
1	Roger Villemaire	An Approximation Semantics for the Propositional Mu-Calculus.	MFCS	2002	DBLP DOI BibTeX RDF
1	Olivier Carton	Accessibility in Automata on Scattered Linear Orderings.	MFCS	2002	DBLP DOI BibTeX RDF
1	Didier Caucal	On Infinite Terms Having a Decidable Monadic Theory.	MFCS	2002	DBLP DOI BibTeX RDF
1	Aleksei V. Fishkin, Guochuan Zhang	On Maximizing the Throughput of Multiprocessor Tasks.	MFCS	2002	DBLP DOI BibTeX RDF	approximation algorithm, complexity, throughput, Multiprocessor task
1	Benoît Masson, Philippe Schnoebelen	On Verifying Fair Lossy Channel Systems.	MFCS	2002	DBLP DOI BibTeX RDF
1	Mary Cryan, Peter Bro Miltersen	On Pseudorandom Generators in NC.	MFCS	2001	DBLP DOI BibTeX RDF
1	Filippo Mignosi, Jeffrey O. Shallit, Ming-wei Wang	Variations on a Theorem of Fine & Wilf.	MFCS	2001	DBLP DOI BibTeX RDF
1	Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter	The k-Median Problem for Directed Trees.	MFCS	2001	DBLP DOI BibTeX RDF
1	Dana Randall	Decomposition Methods and Sampling Circuits in the Cartesian Lattice.	MFCS	2001	DBLP DOI BibTeX RDF
1	Arseny M. Shur, Yulia V. Konovalova	On the Periods of Partial Words.	MFCS	2001	DBLP DOI BibTeX RDF	combinatorics of words, formal languages
1	Zhuozhi Wang, Kaizhong Zhang	Alignment between Two RNA Structures.	MFCS	2001	DBLP DOI BibTeX RDF
1	Pavel Pudlák	On Reducibility and Symmetry of Disjoint NP-Pairs.	MFCS	2001	DBLP DOI BibTeX RDF
1	Libor Polák	Syntactic Semiring of a Language.	MFCS	2001	DBLP DOI BibTeX RDF	syntactic semiring, rational languages
1	Bartek Klin, Piotr Hoffman, Andrzej Tarlecki, Lutz Schröder, Till Mossakowski	Checking Amalgamability Conditions for C ASL Architectural Specifications.	MFCS	2001	DBLP DOI BibTeX RDF	formal specification and program development, CASL, algorithms, decidability, architectural specifications, amalgamation
1	Galina Jirásková	Note on Minimal Finite Automata.	MFCS	2001	DBLP DOI BibTeX RDF
1	Christophe Morvan, Colin Stirling	Rational Graphs Trace Context-Sensitive Languages.	MFCS	2001	DBLP DOI BibTeX RDF
1	Thomas Erlebach	Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings.	MFCS	2001	DBLP DOI BibTeX RDF
1	Georg Gottlob, Nicola Leone, Francesco Scarcello	Hypertree Decompositions: A Survey.	MFCS	2001	DBLP DOI BibTeX RDF
1	Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos	(H, C, K)-Coloring: Fast, Easy, and Hard Cases.	MFCS	2001	DBLP DOI BibTeX RDF
1	Luigi Santocanale	On the Equational Definition of the Least Prefixed Point.	MFCS	2001	DBLP DOI BibTeX RDF
1	Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte	Randomness and Reducibility.	MFCS	2001	DBLP DOI BibTeX RDF
1	Frank Neven, Thomas Schwentick, Victor Vianu	Towards Regular Languages over Infinite Alphabets.	MFCS	2001	DBLP DOI BibTeX RDF
1	Cristopher Moore, Pascal Tesson, Denis Thérien	Satisfiability of Systems of Equations over Finite Monoids.	MFCS	2001	DBLP DOI BibTeX RDF
1	Martin Beaudry, Markus Holzer 0001	The Complexity of Tensor Circuit Evaluation.	MFCS	2001	DBLP DOI BibTeX RDF
1	Thomas Wilke	Linear Temporal Logic and Finite Semigroups.	MFCS	2001	DBLP DOI BibTeX RDF
1	Uwe Schöning	New Algorithms for k -SAT Based on the Local Search Principle.	MFCS	2001	DBLP DOI BibTeX RDF
1	Jirí Sgall, Ales Pultr, Petr Kolman (eds.)	Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings	MFCS	2001	DBLP DOI BibTeX RDF
1	Viliam Geffert	Space Hierarchy Theorem Revised.	MFCS	2001	DBLP DOI BibTeX RDF	Computational complexity, Space complexity
1	Arfst Nickelsen	Partial Information and Special Case Algorithms.	MFCS	2001	DBLP DOI BibTeX RDF
1	Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss	Complexity Note on Mixed Hypergraphs.	MFCS	2001	DBLP DOI BibTeX RDF

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