Search results for "FCT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Klaus Meer	Almost Transparent Short Proofs for NPℝ.	FCT	2011	DBLP DOI BibTeX RDF
1	Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger	Parameterized Complexity of Vertex Deletion into Perfect Graph Classes.	FCT	2011	DBLP DOI BibTeX RDF
1	Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip	The Effect of Homogeneity on the Complexity of k-Anonymity.	FCT	2011	DBLP DOI BibTeX RDF
1	Marius Zimand	On the Optimal Compression of Sets in PSPACE.	FCT	2011	DBLP DOI BibTeX RDF
1	Daniel Lokshtanov	Kernelization: An Overview.	FCT	2011	DBLP DOI BibTeX RDF
1	José Meseguer 0001, Grigore Rosu	The Rewriting Logic Semantics Project: A Progress Report.	FCT	2011	DBLP DOI BibTeX RDF
1	A. N. Trahtman	Modifying the Upper Bound on the Length of Minimal Synchronizing Word.	FCT	2011	DBLP DOI BibTeX RDF
1	Petr A. Golovach, Daniël Paulusma, Jian Song 0005	Coloring Graphs without Short Cycles and Long Induced Paths.	FCT	2011	DBLP DOI BibTeX RDF
1	Yuri Gurevich	Impugning Randomness, Convincingly.	FCT	2011	DBLP DOI BibTeX RDF
1	Jacques M. Bahi, Jean-François Couchot, Christophe Guyeux, Adrien Richard	On the Link between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems.	FCT	2011	DBLP DOI BibTeX RDF
1	Guillaume Malod	Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes.	FCT	2011	DBLP DOI BibTeX RDF
1	Elliot Fairweather, Maribel Fernández, Murdoch James Gabbay	Principal Types for Nominal Theories.	FCT	2011	DBLP DOI BibTeX RDF
1	Mila Dalla Preda, Cinzia Di Giusto	Hunting Distributed Malware with the κ-Calculus.	FCT	2011	DBLP DOI BibTeX RDF
1	Bart M. P. Jansen, Stefan Kratsch	Data Reduction for Graph Coloring Problems.	FCT	2011	DBLP DOI BibTeX RDF
1	Jos C. M. Baeten, Bas Luttik, Paul van Tilburg	Reactive Turing Machines.	FCT	2011	DBLP DOI BibTeX RDF
1	Rafal Witkowski	1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs.	FCT	2009	DBLP DOI BibTeX RDF
1	Viliam Geffert, Jozef Gajdos	Multiway In-Place Merging.	FCT	2009	DBLP DOI BibTeX RDF	In-place algorithms, sorting, merging
1	Olivier Gauwin, Joachim Niehren, Sophie Tison	Earliest Query Answering for Deterministic Nested Word Automata.	FCT	2009	DBLP DOI BibTeX RDF
1	Elena S. Oshevskaya	Open Maps Bisimulations for Higher Dimensional Automata Models.	FCT	2009	DBLP DOI BibTeX RDF
1	Riccardo Dondi	The Longest Haplotype Reconstruction Problem Revisited.	FCT	2009	DBLP DOI BibTeX RDF
1	Pietro Cenciarelli, Daniele Gorla, Ivano Salvo	Depletable Channels: Dynamics and Behaviour.	FCT	2009	DBLP DOI BibTeX RDF
1	Mahdi Cheraghchi	Noise-Resilient Group Testing: Limitations and Constructions.	FCT	2009	DBLP DOI BibTeX RDF
1	Adam Roman	Decision Version of the Road Coloring Problem Is NP-Complete.	FCT	2009	DBLP DOI BibTeX RDF
1	Marcin Kik	Correcting Sorted Sequences in a Single Hop Radio Network.	FCT	2009	DBLP DOI BibTeX RDF
1	Peter Damaschke, Azam Sheikh Muhammad	Competitive Group Testing and Learning Hidden Vertex Covers with Minimum Adaptivity.	FCT	2009	DBLP DOI BibTeX RDF
1	Miroslaw Kutylowski, Witold Charatonik, Maciej Gebala (eds.)	Fundamentals of Computation Theory, 17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings	FCT	2009	DBLP DOI BibTeX RDF
1	Slawomir Staworko, Grégoire Laurence, Aurélien Lemay, Joachim Niehren	Equivalence of Deterministic Nested Word to Word Transducers.	FCT	2009	DBLP DOI BibTeX RDF	XML, Trees, automata, context-free grammars, transducers
1	Erich Grädel, Lukasz Kaiser, Roman Rabinovich 0001	Directed Graphs of Entanglement Two.	FCT	2009	DBLP DOI BibTeX RDF
1	Colin Cooper, Andrew R. A. McGrae, Michele Zito 0001	Martingales on Trees and the Empire Chromatic Number of Random Trees.	FCT	2009	DBLP DOI BibTeX RDF
1	Ryszard Janicki, Dai Tri Man Le, Nadezhda Zubkova	Closure Operators for Order Structures.	FCT	2009	DBLP DOI BibTeX RDF
1	Krishnendu Chatterjee, Laurent Doyen 0001, Thomas A. Henzinger	Alternating Weighted Automata.	FCT	2009	DBLP DOI BibTeX RDF
1	Turlough Neary, Damien Woods	Small Weakly Universal Turing Machines.	FCT	2009	DBLP DOI BibTeX RDF
1	Michael A. Bender, Sándor P. Fekete, Tom Kamphans, Nils Schweer	Maintaining Arrays of Contiguous Objects.	FCT	2009	DBLP DOI BibTeX RDF
1	Kei Uchizawa, Takao Nishizeki, Eiji Takimoto	Energy Complexity and Depth of Threshold Circuits.	FCT	2009	DBLP DOI BibTeX RDF
1	Meena Mahajan, B. V. Raghavendra Rao	Small-Space Analogues of Valiant's Classes.	FCT	2009	DBLP DOI BibTeX RDF
1	Moti Yung	How to Guard the Guards Themselves.	FCT	2009	DBLP DOI BibTeX RDF	Key Evolving Cryptosystems, Proactive Cryptosystems, Public Key cryptography, Attacks, Leakage, Countermeasures, Physical Security, Threshold cryptosystems, Cryptographic Keys
1	John Case, Samuel E. Moelius	Independence Results for n-Ary Recursion Theorems.	FCT	2009	DBLP DOI BibTeX RDF
1	Krzysztof Krzywdzinski	A Local Distributed Algorithm to Approximate MST in Unit Disc Graphs.	FCT	2009	DBLP DOI BibTeX RDF
1	Thomas Thierauf, Fabian Wagner	Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space.	FCT	2009	DBLP DOI BibTeX RDF
1	Subhas Kumar Ghosh, Koushik Sinha	On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs.	FCT	2009	DBLP DOI BibTeX RDF
1	Paul Hänsch, Michaela Slaats, Wolfgang Thomas	Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies.	FCT	2009	DBLP DOI BibTeX RDF
1	Pim van 't Hof, Daniël Paulusma, Johan M. M. van Rooij	Computing Role Assignments of Chordal Graphs.	FCT	2009	DBLP DOI BibTeX RDF
1	Andreas Goerdt	On Random Betweenness Constraints.	FCT	2009	DBLP DOI BibTeX RDF	random structures, Algorithms, logic, probabilistic analysis
1	Michael Huth 0001, Nir Piterman, Daniel Wagner 0002	Three-Valued Abstractions of Markov Chains: Completeness for a Sizeable Fragment of PCTL.	FCT	2009	DBLP DOI BibTeX RDF
1	Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi	The k-Anonymity Problem Is Hard.	FCT	2009	DBLP DOI BibTeX RDF
1	Sadish Sadasivam, Huaming Zhang	NP-Completeness of st-Orientations for Plane Graphs.	FCT	2009	DBLP DOI BibTeX RDF
1	Adrian Diaconu, Florin Manea, Catalin Tiseanu	Combinatorial Queries and Updates on Partial Words.	FCT	2009	DBLP DOI BibTeX RDF
1	Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis	Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs.	FCT	2007	DBLP DOI BibTeX RDF
1	Martin Kutrib, Andreas Malcher	Real-Time Reversible Iterative Arrays.	FCT	2007	DBLP DOI BibTeX RDF
1	Chi-Jen Lu, Shi-Chun Tsai, Hsin-Lung Wu	Impossibility Results on Weakly Black-Box Hardness Amplification.	FCT	2007	DBLP DOI BibTeX RDF
1	Sebastian Dörn, Thomas Thierauf	The Quantum Query Complexity of Algebraic Properties.	FCT	2007	DBLP DOI BibTeX RDF
1	Henrik Björklund, Thomas Schwentick	On Notions of Regularity for Data Languages.	FCT	2007	DBLP DOI BibTeX RDF
1	Alexander Meduna, Jirí Techet	Maximal and Minimal Scattered Context Rewriting.	FCT	2007	DBLP DOI BibTeX RDF
1	Hartmut Messerschmidt, Friedrich Otto	Strictly Deterministic CD-Systems of Restarting Automata.	FCT	2007	DBLP DOI BibTeX RDF
1	Didier Caucal, Dinh Trong Hieu	Path Algorithms on Regular Graphs.	FCT	2007	DBLP DOI BibTeX RDF
1	Miroslav Ciric 0001, Aleksandar Stamenkovic, Jelena Ignjatovic, Tatjana Petkovic	Factorization of Fuzzy Automata.	FCT	2007	DBLP DOI BibTeX RDF
1	Gyula Györ	Representing the Boolean OR Function by Quadratic Polynomials Modulo 6.	FCT	2007	DBLP DOI BibTeX RDF
1	Nadia Busi, Claudio Zandron	On the Computational Power of Genetic Gates with Interleaving Semantics: The Power of Inhibition and Degradation.	FCT	2007	DBLP DOI BibTeX RDF
1	Viviana Bono, Jaroslaw D. M. Kusmierek	FJMIP: A Calculus for a Modular Object Initialization.	FCT	2007	DBLP DOI BibTeX RDF
1	Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette	Pattern Matching in Protein-Protein Interaction Graphs.	FCT	2007	DBLP DOI BibTeX RDF
1	Oscar H. Ibarra, Sara Woodworth	Spiking Neural P Systems: Some Characterizations.	FCT	2007	DBLP DOI BibTeX RDF	asynchronous mode, sequential mode, partially blind counter machine, Spiking neural P system, language generator, semilinear set
1	Erzsébet Csuhaj-Varjú, Zoltán Ésik (eds.)	Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings	FCT	2007	DBLP DOI BibTeX RDF
1	Alexander Okhotin	Expressive Power of LL(k) Boolean Grammars.	FCT	2007	DBLP DOI BibTeX RDF
1	Robert Brijder, Miika Langille, Ion Petre	A String-Based Model for Simple Gene Assembly.	FCT	2007	DBLP DOI BibTeX RDF
1	Leah Epstein, Asaf Levin, Rob van Stee	Multi-dimensional Packing with Conflicts.	FCT	2007	DBLP DOI BibTeX RDF
1	Philip J. Scott	Traces, Feedback, and the Geometry of Computation (Abstract).	FCT	2007	DBLP DOI BibTeX RDF
1	Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe 0001	On the Complexity of Kings.	FCT	2007	DBLP DOI BibTeX RDF
1	László Lovász 0001	Approximating Graphs by Graphs and Functions (Abstract).	FCT	2007	DBLP DOI BibTeX RDF
1	Mathias Samuelides, Luc Segoufin	Complexity of Pebble Tree-Walking Automata.	FCT	2007	DBLP DOI BibTeX RDF
1	Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw 0001	Efficient Parameterized Preprocessing for Cluster Editing.	FCT	2007	DBLP DOI BibTeX RDF
1	Jacques Duparc, Filip Murlak	On the Topological Complexity of Weakly Recognizable Tree Languages.	FCT	2007	DBLP DOI BibTeX RDF
1	Andrea Sattler-Klein	Some Complexity Results for Prefix Gröbner Bases in Free Monoid Rings.	FCT	2007	DBLP DOI BibTeX RDF
1	Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar	Local Testing of Message Sequence Charts Is Difficult.	FCT	2007	DBLP DOI BibTeX RDF
1	Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop	Productivity of Stream Definitions.	FCT	2007	DBLP DOI BibTeX RDF
1	Michael Hoffmann 0002, Richard M. Thomas	Notions of Hyperbolicity in Monoids.	FCT	2007	DBLP DOI BibTeX RDF
1	Abdullah N. Arslan	A Largest Common d-Dimensional Subsequence of Two d-Dimensional Strings.	FCT	2007	DBLP DOI BibTeX RDF	common subsequence, multi-dimensional string, dynamic programming, image, NP
1	Clelia de Felice, Gabriele Fici, Rosalba Zizza	Marked Systems and Circular Splicing.	FCT	2007	DBLP DOI BibTeX RDF
1	Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski	On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time.	FCT	2007	DBLP DOI BibTeX RDF
1	Hadas Shachnai, Omer Yehezkely	Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs.	FCT	2007	DBLP DOI BibTeX RDF
1	Takeyuki Tamura, Tatsuya Akutsu	An O(1.787n)-Time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes.	FCT	2007	DBLP DOI BibTeX RDF
1	Michal Kunc	The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable.	FCT	2007	DBLP DOI BibTeX RDF
1	Henning Bordihn, György Vaszil	Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems.	FCT	2007	DBLP DOI BibTeX RDF
1	Eric Bach 0001, Jin-yi Cai	A Novel Information Transmission Problem and Its Optimal Solution.	FCT	2007	DBLP DOI BibTeX RDF
1	Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg	From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates.	FCT	2007	DBLP DOI BibTeX RDF
1	Hans-Georg Breunig	The Complexity of Membership Problems for Circuits over Sets of Positive Numbers.	FCT	2007	DBLP DOI BibTeX RDF	Computational complexity, Combinational circuits, Arithmetic circuits
1	Johan Kwisthout	The Computational Complexity of Monotonicity in Probabilistic Networks.	FCT	2007	DBLP DOI BibTeX RDF
1	Jin-yi Cai, Pinyan Lu	On Block-Wise Symmetric Signatures for Matchgates.	FCT	2007	DBLP DOI BibTeX RDF
1	Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Mihaela Sighireanu	Rewriting Systems with Data.	FCT	2007	DBLP DOI BibTeX RDF
1	Mihai Ionescu, Dragos Sburlan	P Systems with Adjoining Controlled Communication Rules.	FCT	2007	DBLP DOI BibTeX RDF
1	Thomas Colcombet	Factorisation Forests for Infinite Words.	FCT	2007	DBLP DOI BibTeX RDF	infinite words, automata, Formal languages, semigroups
1	Rajat Mittal 0001, Mario Szegedy	Product Rules in Semidefinite Programming.	FCT	2007	DBLP DOI BibTeX RDF
1	Michael Brinkmeier	A Simple and Fast Min-cut Algorithm.	FCT	2005	DBLP DOI BibTeX RDF
1	Pawel Waszkiewicz	Completeness and Compactness of Quantitative Domains.	FCT	2005	DBLP DOI BibTeX RDF
1	Jérôme Monnot, Sophie Toulouse	Approximation Results for the Weighted P4 Partition Problems.	FCT	2005	DBLP DOI BibTeX RDF	3-length chain, standard approximation, differential approximation, approximation algorithms, Graph partition, performance ratio
1	Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin	Clique-Width for Four-Vertex Forbidden Subgraphs.	FCT	2005	DBLP DOI BibTeX RDF
1	Andreas Brandstädt, Van Bang Le, Suhail Mahfud	New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem.	FCT	2005	DBLP DOI BibTeX RDF
1	Peeter Laud, Varmo Vene	A Type System for Computationally Secure Information Flow.	FCT	2005	DBLP DOI BibTeX RDF
1	Maciej Liskiewicz, Rüdiger Reischuk (eds.)	Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings	FCT	2005	DBLP DOI BibTeX RDF
1	Akimitsu Ono, Shin-Ichi Nakano	Constant Time Generation of Linear Extensions.	FCT	2005	DBLP DOI BibTeX RDF
1	Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois	The Complexity of Semilinear Problems in Succinct Representation.	FCT	2005	DBLP DOI BibTeX RDF

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