Search results for "FCT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Robert Rettinger, Rutger Verbeek	Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case.	FCT	2001	DBLP DOI BibTeX RDF
1	A. N. Trahtman	Piecewise and Local Threshold Testability of DFA.	FCT	2001	DBLP DOI BibTeX RDF	locally threshold testable, piecewise testable, locally testable, syntactic semigroup, algorithm, automaton, transition graph
1	Arfst Nickelsen, Till Tantau	Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions.	FCT	2001	DBLP DOI BibTeX RDF	polynomial time reductions, verboseness, p-selectivity, positive reductions, structural complexity, partial information
1	Gabriel Valiente	A General Method for Graph Isomorphism.	FCT	2001	DBLP DOI BibTeX RDF
1	Leszek Gasieniec, Igor Potapov	Time/Space Efficient Compressed Pattern Matching.	FCT	2001	DBLP DOI BibTeX RDF
1	Girts Linde	Equivalence Problem of Composite Class Diagrams.	FCT	2001	DBLP DOI BibTeX RDF
1	Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski	On Computational Power of Quantum Branching Programs.	FCT	2001	DBLP DOI BibTeX RDF
1	Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse	Differential Approximation Results for the Traveling Salesman Problem with Distances 1 and 2.	FCT	2001	DBLP DOI BibTeX RDF
1	Nataly S. Moskaljova, Irina B. Virbitskaite	On the Category of Event Structures with Dense Time.	FCT	2001	DBLP DOI BibTeX RDF	timed event structures, timed bisimulation, category theory
1	Werner Kuich	Cones, Semi-AFPs, and AFPs of Algebraic Power Series.	FCT	2001	DBLP DOI BibTeX RDF
1	Jouni Järvinen	Dense Families and Key Functions of Database Relation Instances.	FCT	2001	DBLP DOI BibTeX RDF	Armstrong system, Dense family, Key function, Functional dependency, Key, Matrix representation
1	Juhani Karhumäki	Challenges of Commutation.	FCT	2001	DBLP DOI BibTeX RDF
1	Massimo Pica Ciamarra	Quantum Reversibility and a New Model of Quantum Automaton.	FCT	2001	DBLP DOI BibTeX RDF
1	Janis Barzdins, Rusins Freivalds, Carl H. Smith	Towards Axiomatic Basis of Inductive Inference.	FCT	2001	DBLP DOI BibTeX RDF
1	Aija Berzina, Richard F. Bonner	Ambainis-Freivalds' Algorithm for Measure-Once Automata.	FCT	2001	DBLP DOI BibTeX RDF
1	Andrej Dubrovsky	Space-Efficient 1.5-Way Quantum Turing Machine.	FCT	2001	DBLP DOI BibTeX RDF
1	Taneli Mielikäinen, Esko Ukkonen	The Complexity of Maximum Matroid-Greedoid Intersection.	FCT	2001	DBLP DOI BibTeX RDF
1	Marcin Ciura	Best Increments for the Average Case of Shellsort.	FCT	2001	DBLP DOI BibTeX RDF
1	Marek Karpinski	Approximating Bounded Degree Instances of NP-Hard Problems.	FCT	2001	DBLP DOI BibTeX RDF
1	Thomas Erlebach, Danica Vukadinovic	New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs.	FCT	2001	DBLP DOI BibTeX RDF
1	Ruvim Lipyanski	Pythagorean Triples in Unification Theory of Nilpotent Rings.	FCT	2001	DBLP DOI BibTeX RDF
1	Tanya Plotkin	Fuzzy Sets and Algorithms of Distributed Task Allocation for Cooperative Agents.	FCT	2001	DBLP DOI BibTeX RDF
1	Bernhard Heinemann	Modelling Change with the Aid of Knowledge and Time.	FCT	2001	DBLP DOI BibTeX RDF
1	Oksana Scegulnaja	Quantum Real-Time Turing Machine.	FCT	2001	DBLP DOI BibTeX RDF
1	Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe	If P != NP Then Some Strongly Noninvertible Functions Are Invertible.	FCT	2001	DBLP DOI BibTeX RDF	Computational and Structural Complexity
1	Farid M. Ablayev, Svetlana Ablayeva	A Discrete Approximation and Communication Complexity Approach to the Superposition Problem.	FCT	2001	DBLP DOI BibTeX RDF
1	Umesh V. Vazirani	Quantum Algorithms.	FCT	2001	DBLP DOI BibTeX RDF
1	Janis Cirulis	Are There Essentially Incomplete Knowledge Representation Systems?	FCT	2001	DBLP DOI BibTeX RDF	complete information, fuzzification, knowledge representation system, simulation, uncertainty
1	Andreas Brandstädt	On Robust Algorithms for the Maximum Weight Stable Set Problem.	FCT	2001	DBLP DOI BibTeX RDF	Maximum Weight Stable Set Problem on graphs, modules and homogeneous sets in graphs, graph structure, clique width, robust algorithms, prime graphs
1	Mati Tombak, Ain Isotamm, Tõnu Tamme	On Logical Method for Counting Dedekind Numbers.	FCT	2001	DBLP DOI BibTeX RDF
1	Janis Buls, Vaira Buza, Roberts Glaudins	Representation of Autonomous Automata.	FCT	2001	DBLP DOI BibTeX RDF
1	Christophe Papazian, Eric Rémila	Linear Time Recognizer for Subsets of Z2.	FCT	2001	DBLP DOI BibTeX RDF
1	Anna Gambin, Piotr Pokarowski	A Combinatorial Aggregation Algorithm for Stationary Distribution of a Large Markov Chain.	FCT	2001	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Andrzej Lingas	Approximation Algorithms for Time-Dependent Orienteering.	FCT	2001	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli	Approximating Minimum Cocolourings.	FCT	2001	DBLP DOI BibTeX RDF
1	Monaldo Mastrolilli	Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems.	FCT	2001	DBLP DOI BibTeX RDF
1	Eike Kiltz	A Primitive for Proving the Security of Every Bit and About Universal Hash Functions & Hard Core Bits.	FCT	2001	DBLP DOI BibTeX RDF
1	Boris I. Plotkin, Tanya Plotkin	Universal Algebra and Computer Science.	FCT	2001	DBLP DOI BibTeX RDF
1	Andrew V. Sokolov	Mathematical Models and Optimal Algorithms of Dynamic Data Structure Control.	FCT	2001	DBLP DOI BibTeX RDF
1	Foto N. Afrati, Ioannis Milis	Designing PTASs for MIN-SUM Scheduling Problems.	FCT	2001	DBLP DOI BibTeX RDF
1	Benjamin Doerr	Structured Randomized Rounding and Coloring.	FCT	2001	DBLP DOI BibTeX RDF	hypergraph coloring, randomized algorithms, integer linear programming, discrepancy, randomized rounding
1	Bella V. Rozenblat	On Recursively Enumerable Subsets of N and Rees Matrix Semigroups over (Z3 ; + ).	FCT	2001	DBLP DOI BibTeX RDF
1	Matthew Hennessy	Axiomatising Asynchronous Process Calculi (abstract).	FCT	1999	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Mika Hirvensalo	Generalized PCP Is Decidable for Marked Morphisms.	FCT	1999	DBLP DOI BibTeX RDF
1	Catalin Dima	Kleene Theorems for Event-Clock Automata.	FCT	1999	DBLP DOI BibTeX RDF
1	Jeffrey O. Shallit, Ming-wei Wang	On Two-Sided Infinite Fixed Points of Morphisms.	FCT	1999	DBLP DOI BibTeX RDF
1	Janez Zerovnik	Deriving Formulas for Domination Numbers of Fasciagraphs and Rotagraphs.	FCT	1999	DBLP DOI BibTeX RDF
1	Isabelle Ryl, Yves Roos, Mireille Clerbout	Generalized Synchronization Languages.	FCT	1999	DBLP DOI BibTeX RDF
1	Franck Seynhaeve, Sophie Tison, Marc Tommasi	Homomorphisms and Concurrent Term Rewriting.	FCT	1999	DBLP DOI BibTeX RDF
1	Viorica Sofronie-Stokkermans, Karel Stokkermans	Modeling Interaction by Sheaves and Geometric Logic.	FCT	1999	DBLP DOI BibTeX RDF
1	Cristina Bazgan, Wenceslas Fernandez de la Vega	A Polynomial Time Approximation Scheme for Dense MIN 2SAT.	FCT	1999	DBLP DOI BibTeX RDF
1	Roman M. Kolpakov, Gregory Kucherov	On Maximal Repetitions in Words.	FCT	1999	DBLP DOI BibTeX RDF
1	Catherine Pilière	A Confluence Result for a Typed lambda-Calculus of Exception Handling with Fixed-Point.	FCT	1999	DBLP DOI BibTeX RDF
1	Boris A. Trakhtenbrot	Automata and Their Interaction: Definitional Suggestions.	FCT	1999	DBLP DOI BibTeX RDF
1	Chuzo Iwamoto, Tomonobu Hatsuyama, Kenichi Morita, Katsunobu Imai	On Time-Constructible Functions in One-Dimensional Cellular Automata.	FCT	1999	DBLP DOI BibTeX RDF
1	Jonathan Paul Sharp	Tiling Multi-dimensional Arrays.	FCT	1999	DBLP DOI BibTeX RDF
1	Gérard Boudol, Silvano Dal-Zilio	An Interpretation of Extensible Objects.	FCT	1999	DBLP DOI BibTeX RDF
1	Luca Breveglieri, Stefano Crespi-Reghizzi, Alessandra Cherubini	Modeling Operating Systems Schedulers with Multi-Stack-Queue Grammars.	FCT	1999	DBLP DOI BibTeX RDF
1	Carlos Martín-Vide, Alexandru Mateescu	Sewing Grammars.	FCT	1999	DBLP DOI BibTeX RDF
1	Holger Spakowski, Jörg Vogel 0001	The Operators minCh and maxCh on the Polynomial Hierarchy.	FCT	1999	DBLP DOI BibTeX RDF
1	Renate Klempien-Hinrichs, Hans-Jörg Kreowski, Stefan Taubenberger	Correct Translation of Mutually Recursive Function Systems into TOL Collage Grammars.	FCT	1999	DBLP DOI BibTeX RDF
1	Rudolf Freund	Generalized P-Systems.	FCT	1999	DBLP DOI BibTeX RDF
1	Danièle Beauquier, Anatol Slissenko	Decidable Classes of the Verification Problem in a Timed Predicate Logic.	FCT	1999	DBLP DOI BibTeX RDF
1	Jürgen Forster	On Relative Loss Bounds in Generalized Linear Regression.	FCT	1999	DBLP DOI BibTeX RDF
1	Irina B. Virbitskaite, E. Pokozy	A Partial Order Method for the Verification of Time Petri Nets.	FCT	1999	DBLP DOI BibTeX RDF
1	Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe	Restrictive Acceptance Suffices for Equivalence Problems.	FCT	1999	DBLP DOI BibTeX RDF
1	H. C. M. Kleijn, Rémi Morin, Brigitte Rozoy	A General Categorical Connection between Local Event Structures and Local Traces.	FCT	1999	DBLP DOI BibTeX RDF
1	Laurent Juban	Dichotomy Theorem for the Generalized Unique Satisfiability Problem.	FCT	1999	DBLP DOI BibTeX RDF
1	Marek Karpinski	Randomized Complexity of Linear Arrangements and Polyhedra.	FCT	1999	DBLP DOI BibTeX RDF
1	Luminita Dediu, Douglas S. Bridges	Constructive Notes on Uniform and Locally Convex Spaces.	FCT	1999	DBLP DOI BibTeX RDF
1	Ludwig Staiger	The Kolmogorov Complexity of Real Numbers.	FCT	1999	DBLP DOI BibTeX RDF
1	H. N. de Ridder, Hans L. Bodlaender	Graph Automorphisms with Maximal Projection Distances.	FCT	1999	DBLP DOI BibTeX RDF
1	Dorel Lucanu	Axiomatization of the Coherence Property for Categories of Symmetries.	FCT	1999	DBLP DOI BibTeX RDF
1	Teodor Knapik, Étienne Payet	Synchronized Product of Linear Bounded Machines.	FCT	1999	DBLP DOI BibTeX RDF
1	Klaus-Dieter Schewe, Bernhard Thalheim	A Generalization of Dijkstra's Calculus to Typed Program Specifications.	FCT	1999	DBLP DOI BibTeX RDF
1	Henning Bordihn, Jürgen Dassow, György Vaszil	Grammar Systems as Language Analyzers and Recursively Enumerable Languages.	FCT	1999	DBLP DOI BibTeX RDF
1	Manfred Droste, Dietrich Kuske	On Recognizable Languages in Divisibility Monoids.	FCT	1999	DBLP DOI BibTeX RDF
1	Pál Dömösi, Manfred Kudlek	Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages.	FCT	1999	DBLP DOI BibTeX RDF
1	Andrei Paun, Mihaela Paun	State and Transition Complexity of Watson-Crick Finite Automata.	FCT	1999	DBLP DOI BibTeX RDF
1	Andrea Corradini 0001, Reiko Heckel, Ugo Montanari	Tile Transition Systems as Structured Coalgebras.	FCT	1999	DBLP DOI BibTeX RDF
1	Sergio Cabello, Carles Padró, Germán Sáez	Secret Sharing Schemes with Detection of Cheaters for a General Access Structure.	FCT	1999	DBLP DOI BibTeX RDF	Detection of cheaters, Robust and secure schemes, Cryptography, Secret sharing schemes
1	Frank Drewes	Exponential Output Size of Top-Down Tree Transducers.	FCT	1999	DBLP DOI BibTeX RDF
1	Arto Salomaa	Caesar and DNA. Views on Cryptology.	FCT	1999	DBLP DOI BibTeX RDF
1	Thomas Buchholz, Andreas Klein 0001, Martin Kutrib	Iterative Arrays with a Wee Bit Alternation.	FCT	1999	DBLP DOI BibTeX RDF
1	Stavros Georgiades, Marios Mavronicolas, Paul G. Spirakis	Optimal, Distributed Decision-Making: The Case of No Communication.	FCT	1999	DBLP DOI BibTeX RDF
1	Cristian Ene, Traian Muntean	Expressiveness of Point-to-Point versus Broadcast Communications.	FCT	1999	DBLP DOI BibTeX RDF
1	Klaus Reinhardt	A Parallel Context-Free Derivation Hierarchy.	FCT	1999	DBLP DOI BibTeX RDF
1	Gabriel Ciobanu, Gheorghe Paun (eds.)	Fundamentals of Computation Theory, 12th International Symposium, FCT '99, Iasi, Romania, August 30 - September 3, 1999, Proceedings	FCT	1999	DBLP DOI BibTeX RDF
1	Viviana Bono, Michele Bugliesi	Interpretations of Extensible Objects and Types.	FCT	1999	DBLP DOI BibTeX RDF
1	Adriana Popovici, Dan Popovici	delta-Uniformly Decidable Sets and Turing Machines.	FCT	1999	DBLP DOI BibTeX RDF
1	Marios Mavronicolas, Nikos Papadakis	Trade-Off Results for Connection Management.	FCT	1997	DBLP DOI BibTeX RDF
1	Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter	Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata.	FCT	1997	DBLP DOI BibTeX RDF
1	Anna E. Frid	The Subword Complexity of Fixed Points of Binary Uniform Morphisms.	FCT	1997	DBLP DOI BibTeX RDF
1	Antoni W. Mazurkiewicz	Locally Computable Enumerations.	FCT	1997	DBLP DOI BibTeX RDF
1	Ming Li 0001, Paul M. B. Vitányi	Average-Case Analysis via Incompressibility.	FCT	1997	DBLP DOI BibTeX RDF
1	Leszek Gasieniec, Piotr Indyk	Efficient Parallel Computing with Memory Faults.	FCT	1997	DBLP DOI BibTeX RDF
1	Salvatore La Torre, Margherita Napoli, Mimmo Parente	Synchronization of 1-Way Connected Processors.	FCT	1997	DBLP DOI BibTeX RDF
1	Antonio Calabrese	Distributed Acyclic Orientation of Asynchronous Networks.	FCT	1997	DBLP DOI BibTeX RDF
1	Rolf Hennicker, Martin Wirsing	Proof Systems for Struvtured Algebraic Specifications: An Overview.	FCT	1997	DBLP DOI BibTeX RDF
1	Alfons Avermiddig, Manfred Kunde, Andre Osterloh	k-k Sorting on the Multi-Mesh.	FCT	1997	DBLP DOI BibTeX RDF

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