Search results for "FCT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough	A Faster and Simpler 2-Approximation Algorithm for Block Sorting.	FCT	2005	DBLP DOI BibTeX RDF	approximation algori- thms, block sorting, transposition sorting, optical character recognition, Design and analysis of algorithms
1	Holger Spakowski, Rahul Tripathi	On the Power of Unambiguity in Alternating Machines.	FCT	2005	DBLP DOI BibTeX RDF
1	Till Tantau	Logspace Optimization Problems and Their Approximability Properties.	FCT	2005	DBLP DOI BibTeX RDF
1	Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga	The Delayed k-Server Problem.	FCT	2005	DBLP DOI BibTeX RDF	approximation and randomized algorithms, Design and analysis of algorithms
1	Chuzo Iwamoto, Yoshiaki Nakashiba, Kenichi Morita, Katsunobu Imai	Translational Lemmas for Alternating TMs and PRAMs.	FCT	2005	DBLP DOI BibTeX RDF
1	Hans Ulrich Simon	Perfect Reconstruction of Black Pixels Revisited.	FCT	2005	DBLP DOI BibTeX RDF
1	Philippe Moser	Generic Density and Small Span Theorem.	FCT	2005	DBLP DOI BibTeX RDF
1	Bogdan S. Chlebus, Dariusz R. Kowalski	Almost Optimal Explicit Selectors.	FCT	2005	DBLP DOI BibTeX RDF
1	Martin Grohe, Christoph Koch 0001, Nicole Schweikardt	The Complexity of Querying External Memory and Streaming Data.	FCT	2005	DBLP DOI BibTeX RDF
1	Bernd Gärtner, Leo Rüst	Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems.	FCT	2005	DBLP DOI BibTeX RDF
1	Tomasz Jurdzinski, Krzysztof Lorys	Leftist Grammars and the Chomsky Hierarchy.	FCT	2005	DBLP DOI BibTeX RDF
1	Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven	On the Black-Box Complexity of Sperner's Lemma.	FCT	2005	DBLP DOI BibTeX RDF
1	Julien Bernet, David Janin	Tree Automata and Discrete Distributed Games.	FCT	2005	DBLP DOI BibTeX RDF
1	Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk	The Maximum Resource Bin Packing Problem.	FCT	2005	DBLP DOI BibTeX RDF
1	Aduri Pavan, N. V. Vinodchandran	Relations Between Average-Case and Worst-Case Complexity.	FCT	2005	DBLP DOI BibTeX RDF
1	Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang 0053	Bounds on the Power of Constant-Depth Quantum Circuits.	FCT	2005	DBLP DOI BibTeX RDF
1	Yo-Sub Han, Derick Wood	A New Linearizing Restriction in the Pattern Matching Problem.	FCT	2005	DBLP DOI BibTeX RDF	string pattern matching, design and analysis of algorithms, Automata and formal languages
1	Daniel A. Spielman	The Smoothed Analysis of Algorithms.	FCT	2005	DBLP DOI BibTeX RDF
1	Markus Holzer 0001, Friedrich Otto	Shrinking Multi-pushdown Automata.	FCT	2005	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch	Exact Algorithms for Graph Homomorphisms.	FCT	2005	DBLP DOI BibTeX RDF
1	Klaus Meer, Martin Ziegler 0001	An Explicit Solution to Post's Problem over the Reals.	FCT	2005	DBLP DOI BibTeX RDF
1	Joachim Giesen, Dieter Mitsche	Reconstructing Many Partitions Using Spectral Techniques.	FCT	2005	DBLP DOI BibTeX RDF
1	Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda	Fully Incremental LCS Computation.	FCT	2005	DBLP DOI BibTeX RDF
1	Beate Bollig	Property Testing and the Branching Program Size of Boolean Functions.	FCT	2005	DBLP DOI BibTeX RDF
1	Alexander Grigoriev, Hans L. Bodlaender	Algorithms for Graphs Embeddable with Few Crossings Per Edge.	FCT	2005	DBLP DOI BibTeX RDF
1	Magnus Bordewich, Martin E. Dyer, Marek Karpinski	Path Coupling Using Stopping Times.	FCT	2005	DBLP DOI BibTeX RDF
1	Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot	(Non)-Approximability for the Multi-criteria TSP(1, 2).	FCT	2005	DBLP DOI BibTeX RDF
1	Matthias P. Krieger	On the Incompressibility of Monotone DNFs.	FCT	2005	DBLP DOI BibTeX RDF
1	Sheung-Hung Poon, Chan-Su Shin	Adaptive Zooming in Point Set Labeling.	FCT	2005	DBLP DOI BibTeX RDF	GIS, Computational geometry, zooming, map-labeling
1	Michael Hoffmann 0002, Richard M. Thomas	Biautomatic Semigroups.	FCT	2005	DBLP DOI BibTeX RDF	biautomatic, automatic, Automata and formal languages, semigroups
1	Tomoyuki Yamakami	Collapsing Recursive Oracles for Relativized Polynomial Hierarchies.	FCT	2005	DBLP DOI BibTeX RDF
1	Julien Cristau, Christof Löding, Wolfgang Thomas	Deterministic Automata on Unranked Trees.	FCT	2005	DBLP DOI BibTeX RDF
1	Aleksy Schubert	A Self-dependency Constraint in the Simply Typed Lambda Calculus.	FCT	2005	DBLP DOI BibTeX RDF
1	Benedikt Bollig	On the Expressiveness of Asynchronous Cellular Automata.	FCT	2005	DBLP DOI BibTeX RDF
1	Kouichi Hirata, Megumi Kuwabara, Masateru Harao	On Finding Acyclic Subhypergraphs.	FCT	2005	DBLP DOI BibTeX RDF
1	Jiong Guo, Rolf Niedermeier, Daniel Raible 0001	Improved Algorithms and Complexity Results for Power Domination in Graphs.	FCT	2005	DBLP DOI BibTeX RDF
1	Daniel Meister 0001	Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals.	FCT	2005	DBLP DOI BibTeX RDF
1	Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura	On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph Problems.	FCT	2005	DBLP DOI BibTeX RDF
1	Markus Bläser, L. Shankar Ram	An Improved Approximation Algorithm for TSP with Distances One and Two.	FCT	2005	DBLP DOI BibTeX RDF
1	Birgit Schelm	Average-Case Non-approximability of Optimisation Problems.	FCT	2005	DBLP DOI BibTeX RDF
1	Sven Köhler 0001, Christian Schindelhauer, Martin Ziegler 0001	On Approximating Real-World Halting Problems.	FCT	2005	DBLP DOI BibTeX RDF
1	Lyudmil Aleksandrov, Anil Maheshwari, Jörg-Rüdiger Sack	An Improved Approximation Algorithm for Computing Geometric Shortest Paths.	FCT	2003	DBLP DOI BibTeX RDF
1	Joachim Gudmundsson	Constructing Sparse t-Spanners with Small Separators.	FCT	2003	DBLP DOI BibTeX RDF
1	Zheng Sun, John H. Reif	Adaptive and Compact Discretization for Weighted Region Optimal Path Finding.	FCT	2003	DBLP DOI BibTeX RDF
1	Farid M. Ablayev, Aida Gainutdinova	Classical Simulation Complexity of Quantum Machines.	FCT	2003	DBLP DOI BibTeX RDF
1	Peter Damaschke	Fast Perfect Phylogeny Haplotype Inference.	FCT	2003	DBLP DOI BibTeX RDF
1	Werner Kuich, Klaus W. Wagner	On the Exponentiation of Languages.	FCT	2003	DBLP DOI BibTeX RDF
1	Jan Arpe, Andreas Jakoby, Maciej Liskiewicz	One-Way Communication Complexity of Symmetric Boolean Functions.	FCT	2003	DBLP DOI BibTeX RDF
1	Binhai Zhu	On Lawson's Oriented Walk in Random Delaunay Triangulations.	FCT	2003	DBLP DOI BibTeX RDF	Random Delaunay triangulation, average-case analysis, point location
1	Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin	Operations Preserving Recognizable Languages.	FCT	2003	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle	Graph Searching, Elimination Trees, and a Generalization of Bandwidth.	FCT	2003	DBLP DOI BibTeX RDF
1	Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux	Languages Defined by Generalized Equality Sets.	FCT	2003	DBLP DOI BibTeX RDF
1	John H. Reif, Zheng Sun	On Boundaries of Highly Visible Spaces and Applications.	FCT	2003	DBLP DOI BibTeX RDF
1	Luis Antunes 0002, Lance Fortnow, N. V. Vinodchandran	Using Depth to Capture Average-Case Complexity.	FCT	2003	DBLP DOI BibTeX RDF
1	Michele Bugliesi, Ambra Ceccato, Sabina Rossi	Context-Sensitive Equivalences for Non-interference Based Protocol Analysis.	FCT	2003	DBLP DOI BibTeX RDF
1	Ivan Damgård, Gudmund Skovbjerg Frandsen	An Extended Quadratic Frobenius Primality Test with Average and Worst Case Error Estimates.	FCT	2003	DBLP DOI BibTeX RDF
1	Patricia A. Evans, Andrew D. Smith	Complexity of Approximating Closest Substring Problems.	FCT	2003	DBLP DOI BibTeX RDF	Closest Substring, Approximation algorithms, Hardness of approximation
1	Sanjeev Arora	Proving Integrality Gaps without Knowing the Linear Program.	FCT	2003	DBLP DOI BibTeX RDF
1	Wan J. Fokkink, Rob J. van Glabbeek, Paulien de Wind	Compositionality of Hennessy-Milner Logic through Structural Operational Semantics.	FCT	2003	DBLP DOI BibTeX RDF
1	Richard J. Lipton, Anastasios Viglas	Non-uniform Depth of Polynomial Time and Space Simulations.	FCT	2003	DBLP DOI BibTeX RDF	Space simulations, non-uniform depth, block respecting computation
1	Philippe Moser	Baire's Categories on Small Complexity Classes.	FCT	2003	DBLP DOI BibTeX RDF
1	Andrzej Lingas, Bengt J. Nilsson (eds.)	Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings	FCT	2003	DBLP DOI BibTeX RDF
1	Ivan Damgård, Gudmund Skovbjerg Frandsen	Efficient Algorithms for GCD and Cubic Residuosity in the Ring of Eisenstein Integers.	FCT	2003	DBLP DOI BibTeX RDF
1	Andrzej Szalas	On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems.	FCT	2003	DBLP DOI BibTeX RDF
1	Christian Pech	Kleene's Theorem for Weighted Tree-Automata.	FCT	2003	DBLP DOI BibTeX RDF	Kleenes theorem, Schützenbergers theorem, rational expression, tree, language, automata, weight
1	Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay	Circuits on Cylinders.	FCT	2003	DBLP DOI BibTeX RDF
1	Marcin Kik	Periodic Multisorting Comparator Networks.	FCT	2003	DBLP DOI BibTeX RDF	parallel algorithms, sorting, comparator networks
1	Jens Gramm, Jiong Guo, Rolf Niedermeier	On Exact and Approximation Algorithms for Distinguishing Substring Selection.	FCT	2003	DBLP DOI BibTeX RDF
1	Grzegorz Stachowiak	Fast Periodic Correction Networks.	FCT	2003	DBLP DOI BibTeX RDF	periodic sorting network, comparator, sorting network
1	Mark Cieliebak, Stephan J. Eidenbenz, Aris Pagourtzis	Composing Equipotent Teams.	FCT	2003	DBLP DOI BibTeX RDF
1	Eric Angel, Evripidis Bampis, Laurent Gourvès	Approximating the Pareto Curve with Local Search for the Bicriteria TSP (1, 2) Problem.	FCT	2003	DBLP DOI BibTeX RDF
1	Martin Kutrib	Dimension- and Time-Hierarchies for Small Time Bounds.	FCT	2003	DBLP DOI BibTeX RDF
1	Till Tantau	Weak Cardinality Theorems for First-Order Logic.	FCT	2003	DBLP DOI BibTeX RDF
1	Gheorghe Paun	Membrane Computing.	FCT	2003	DBLP DOI BibTeX RDF
1	Christos H. Papadimitriou	Games and Networks.	FCT	2003	DBLP DOI BibTeX RDF
1	Monaldo Mastrolilli	Scheduling to Minimize Max Flow Time: Offline and Online Algorithms.	FCT	2003	DBLP DOI BibTeX RDF
1	Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich	Certifying Unsatisfiability of Random 2k-SAT Formulas Using Approximation Techniques.	FCT	2003	DBLP DOI BibTeX RDF
1	Mikael Hammar, Bengt J. Nilsson, Mia Persson	Competitive Exploration of Rectilinear Polygons.	FCT	2003	DBLP DOI BibTeX RDF
1	Takao Asano	An Improved Analysis of Goemans and Williamson's LP-Relaxation for MAX SAT.	FCT	2003	DBLP DOI BibTeX RDF	Approximation algorithm, LP-relaxation, MAX SAT
1	Miroslav Chlebík, Janka Chlebíková	Inapproximability Results for Bounded Variants of Optimization Problems.	FCT	2003	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy P. Spinrad	Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs.	FCT	2003	DBLP DOI BibTeX RDF
1	Ruggero Lanotte, Andrea Maggiolo-Schettini, Simone Tini	Concurrency in Timed Automata.	FCT	2001	DBLP DOI BibTeX RDF
1	Juhani Karhumäki, Wojciech Plandowski, Wojciech Rytter	On the Complexity of Decidable Cases of Commutation Problem for Languages.	FCT	2001	DBLP DOI BibTeX RDF
1	Harald Baier	Efficient Computation of Singular Moduli with Application in Cryptography.	FCT	2001	DBLP DOI BibTeX RDF	class group, modular function, ring class polynomial, singular modulus, cryptography, elliptic curve, Fourier series, complex multiplication
1	Luisa Gargano	Multicasting in Optical Networks.	FCT	2001	DBLP DOI BibTeX RDF
1	Klaus Jansen	Approximation Algorithms for Fractional Covering and Packing Problems, and Applications.	FCT	2001	DBLP DOI BibTeX RDF
1	Michal Walicki, Adis Hodzic, Sigurd Meldal	Compositional Homomorphisms of Relational Structures.	FCT	2001	DBLP DOI BibTeX RDF
1	Dietrich Kuske	Divisibility Monoids: Presentation, Word Problem, and Rational Languages.	FCT	2001	DBLP DOI BibTeX RDF
1	Victor L. Selivanov	Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies.	FCT	2001	DBLP DOI BibTeX RDF
1	Nicolas Ollinger	Two-States Bilinear Intrinsically Universal Cellular Automata.	FCT	2001	DBLP DOI BibTeX RDF
1	Grégory Lafitte	How Powerful Are Infinite Time Machines?	FCT	2001	DBLP DOI BibTeX RDF
1	Aleksei V. Fishkin, Klaus Jansen, Lorant Porkolab	On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks.	FCT	2001	DBLP DOI BibTeX RDF	scheduling, Parallel processing, multiprocessor tasks
1	Olga Sokratova	Linear Automata and Recognizable Subsets in Free Semirings.	FCT	2001	DBLP DOI BibTeX RDF	dynamical (linear) system, recognizable set, semiring
1	Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara	Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables.	FCT	2001	DBLP DOI BibTeX RDF
1	Daniel Král	On Complexity of Colouring Mixed Hypertrees.	FCT	2001	DBLP DOI BibTeX RDF
1	Manfred Kudlek, Yurii Rogozhin	New Small Universal Circular Post Machines.	FCT	2001	DBLP DOI BibTeX RDF
1	Rusins Freivalds (eds.)	Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings	FCT	2001	DBLP DOI BibTeX RDF
1	Kouichi Hirata, Hiroshi Sakamoto	Prediction-Preserving Reducibility with Membership Queries on Formal Languages.	FCT	2001	DBLP DOI BibTeX RDF	prediction-preserving reduction with membership queries, prediction with membership queries, pattern languages, learning theory, context-free grammars, grammatical inference
1	Leah Epstein, Rob van Stee	Optimal Online Flow Time with Resource Augmentation.	FCT	2001	DBLP DOI BibTeX RDF
1	Karlis Freivalds	Curved Edge Routing.	FCT	2001	DBLP DOI BibTeX RDF	edge placement, curved edges, Graph drawing

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