| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Habib Abdulrab, Marianne Maksimenko |
General Solution of Mirror Equation.  |
FCT  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Giora Slutzki, Sándor Vágvölgyi |
A Hierarchy of Deterministic Top-down Tree Transformations. |
FCT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Petra Scheffler, Gerhard J. Woeginger |
Maximum Covering with D Cliques. |
FCT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan A. Bergstra, Gheorghe Stefanescu |
Translations Between Flowchart Schemes and Process Graphs. |
FCT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jilei Yin, Hong Zhu 0004 |
On the Learnability of a Restricted Predicate Formulae. |
FCT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Yves Andre, Francis Bossut |
Decidability of Equivalence for Linear Letter to Letter To-down Tree Transducers. |
FCT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle |
Context-Free Graph Grammars: Separating Vertex Replacement from Hyperedge Replacement. |
FCT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jürgen Ebert |
Efficient Interpretation of State Charts. |
FCT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandru Mateescu |
On Scattered Syntactic Monoids. |
FCT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer Kemp |
Monotonically Labelled Ordered Trees and Multidimensional Binary Trees. |
FCT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Joseph F. Traub |
Information-Based Complexity: Recent Results and Open Problems. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena Barcucci, Renzo Pinzani, E. Rodella, Renzo Sprugnoli |
A Characterization of Binary Search Networks. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Lothar Budach (eds.) |
Fundamentals of Computation Theory, 8th International Symposium, FCT '91, Gosen, Germany, September 9-13, 1991, Proceedings |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes A. Buchmann |
Number Theoretic Algorithms and Cryptology. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Emanuela Fachini, Angelo Monti, Margherita Napoli, Domenico Parente |
Systolic Y-Tree Automata: Closure Properties and Decision Problems. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Danilo Bruschi, Giovanni Pighizzini |
The Complexity of Computing Maximal Word Functions. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Karpinski |
Approximation Algorithms for Counting Problems in Finite Fields. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Néraud |
On the Subsets of Rank Two in a Free Monoid: A Fast Decision Algorithm (Extended Abstract). |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew Chi-Chih Yao |
Recent Progress in Circuit and Communication Complexity (Abstract). |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Dietmar Uhlig |
Boolean Functions with a Large Number of Subfunctions and Small Complexity and Depth. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Kaib |
The Gauß Lattice Basis Reduction Algorithm Succeeds With Any Norm. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic |
Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators (Extended Abstract). |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Louchard, Claire Kenyon, René Schott |
Data Structures Maxima. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Radhakrishna S. Valiveti, B. John Oommen, Jack R. Zgierski |
Adaptive Linear List Reorganization for a System Processing Set Queries. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | György Turán |
A Survey of Some Aspects of Computational Learning Theory (Extended Abstract). |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Kai Salomaa, Sheng Yu 0001 |
Degrees of Nondeterminism for Pushdown Automata. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Oscar H. Ibarra, Nicholas Q. Trân |
On Space-bounded Synchronized Alternating Turing Machines. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Luca Breveglieri, Claudio Citrini, Stefano Crespi-Reghizzi |
Deterministic Dequeue Automata and LL(1) Parsing of Breadth-Depth Grammars. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha |
Exact Analysis of Three Tree Contraction Algorithms. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Hofmeister, Walter Hohberg, Susanne Köhling |
Some Notes on Threshold Circuits, and Multiplication in Depth 4. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Claus-Peter Schnorr, M. Euchner |
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
Optimal versus Stable in Boolean Formulae. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith |
Unambiguity and Fewness for Logarithmic Space. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Kratsch, Lane A. Hemachandra |
On the Complexity of Graph Reconstruction. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Heiko Schröder 0001, Ondrej Sýkora, Imrich Vrto |
Optimal Embedding of a Toroidal Array in a Linear Array. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Antoine Joux, Jacques Stern |
Improving the Critical Density of the Lagarias-Odlyzko Attack Against Subset Sum Problems. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Christos Levcopoulos, Ola Petersson |
An Optimal Adaptive In-place Sorting Algorithm. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander A. Razborov |
Lower Bounds for Deterministic and Nondeterministic Branching Programs. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter M. W. Knijnenburg, Joost N. Kok |
On the Semantics of Atomized Statements - the Parallel-Choice Option (Extended Abstract). |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Dietmar Gröger |
A New Partition Lemma for Planar Graphs and Its Application to Circuit Complexity. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Jürgen Dassow, Klaus-Jörn Lange |
Computational Calculus and Hardest Languages of Automata with Abstract Storages. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Rüdiger Reischuk |
Graph Theoretical Methods for the Design of Parallel Algorithms. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Chardin |
Differential Resultants and Subresultants. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Heinrich |
Efficiency of Monte Carlo Algorithms in Numerical Analysis. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Bogdan S. Chlebus, Imrich Vrto |
Unifying Binary-Search Trees and Permutations. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Kounalis, Michaël Rusinowitch |
Automatic Proof Methods for Algebraic Specifications. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Egon Wanke |
On the Decidability of Integer Subgraph Problems on Context-Free Graph Languages. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Janis Kaneps |
Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Danièle Beauquier, Maurice Nivat, Damian Niwinski |
About the Effect of the Number of Successful Paths in an Infinite Tree on the Recognizability by a Finite Automaton with Büchi Conditions. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin-yi Cai |
Computations Over Infinite Groups. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernd Bank, Teresa Krick, Reinhard Mandel, Pablo Solernó |
A Gemometrical Bound for Integer Programming with Polynomial Constraints. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Christel Baier, Mila E. Majster-Cederbaum |
The Consistency of a Noninterleaving and an Interleaving Model for Full TCSP. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Vivek Gore |
On Strong Separations from AC0 (Extended Abstract). |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Conrado Martinez |
Average-case Analysis of Equality of Binary Trees Under the BST Probability Model. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Pál Dömösi, Zoltán Ésik, Balázs Imreh |
On Product Hierarchies of Automata. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Tibor Kovács |
Inducibility of the Composition of Frontier-to-Root Tree Transformations. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Bertoni, Danilo Bruschi, Deborah Joseph, Meera Sitharam, Paul Young |
Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract). |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen L. Bloom |
The Equational Logic of Iterative Processes. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Immerman |
Descriptive and Computational Complexity. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Litovsky |
Rank of Rational Finitely Generated W-Languages. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominique Geniet, Loÿs Thimonier |
Using Generating Functions to Compute Concurrency. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivan Korec |
Semilinear Real-Time Systolic Trellis Automata. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Kai Salomaa |
Representation of Recursively Enumerable Languages Using Alternating Finite Tree Recognizers. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Marchetti-Spaccamela, Marco Protasi |
Learning Under Uniform Distribution. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Erich Grädel |
Complexity of Formula Classes in First Order Logic with Functions. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Jerzy Skurczynski |
The Borel Hierarchy is Infinite in the Class of Regular Sets of Trees. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierluigi Crescenzi, Alessandro Panconesi |
Completeness in Approximation Classes. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Maciej Liskiewicz, Krzysztof Lorys |
Some Time-Space Bounds for One-Tape Deterministic Turing Machines. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Sutner |
The Computational Complexity of Cellular Automata. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | M. A. Nait Abdallah |
Logic Programming of Some Mathematical Paradoxes. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
The Effect of Null-Chains on the Complexity of Contact Schemes. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Fülöp 0001, Sándor Vágvölgyi |
Iterated Deterministic Top-Down Look-Ahead. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernd Graw |
Decision Problems and Coxeter Groups. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Françon, B. Randrianarimanana, René Schott |
Dynamic Data Structures with Finite Population: A Combinatorial Analysis. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Ulrich Simon |
Approximation Algorithms for Channel Assignment in Cellular Radio Networks. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Efim B. Kinber, Thomas Zeugmann |
Monte-Carlo Inference and Its Relations to Reliable Frequency Identification. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | György Turán |
On Restricted Boolean Circuits. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Ana Gil-Luezas |
A Logic for Nondeterministic Functional Programs (Extended Abstract). |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Carme Àlvarez, Josep Díaz, Jacobo Torán |
Complexity Classes with Complete Problems Between P and NP-C. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Helmut Seidl |
On the Finite Degree of Ambiguity of Finite Tree Automata. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Maass 0001, Theodore A. Slaman |
Extensional Properties of Sets of Time Bounded Complexity (Extended Abstract). |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Habib Abdulrab, Jean-Pierre Pécuchet |
On Word Equations and Makanin's Algorithm. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Luc Coquidé, Max Dauchet, Sophie Tison |
About Connections Between Syntactical and Computational Complexity. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnus Steinby |
Tree Language Problems in Pattern Recognition Theory (Extended Abstract). |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Joost Engelfriet |
Context-Free NCE Graph Grammars. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Ratko Orlandic, John L. Pfaltz |
Analysis of Compact 0-Complete Trees: A New Access Method to Large Databases. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Ludwig Staiger |
Kolmogorov Complexity and Hausdorff Dimension. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrice Séébold |
About a Family of Binary Morphisms which Stationary Words are Sturmian. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen |
Normal and Sinkless Petri Nets. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt |
The Jump Number Problem for Biconvex Graphs and Rectangle Covers of Rectangular Regions. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Janusz A. Brzozowski, Jo C. Ebergen |
Recent Developments in the Design of Asynchronous Circuits. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Weihrauch |
Constructivity, Computability, and Computational Complexity in Analysis. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Krause 0001, Stephan Waack |
On Oblivious Branching Programs of Linear Length (Extended Abstract). |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Miklós Bartha |
Interpretations of Synchronous Flowchart Schemes. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederick N. Springsteel, Ivan Stojmenovic |
Parallel General Prefix Computations with Geometric, Algebraic and Other Applications. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | M. A. Nait Abdallah |
An Extended Framework for Default Reasoning. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Egon Wanke |
The Complexity of Connectivity Problems on Context-Free Graph Languages (Extended Abstract). |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | János Csirik, János Demetrovics, Ferenc Gécseg (eds.) |
Fundamentals of Computation Theory, International Conference FCT'89, Szeged, Hungary, August 21-25, 1989, Proceedings |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Christoph Meinel |
Separating Completely Complexity Classes Related to Polynomial Size Omega-Decision Trees. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Pavel Pudlák |
On the Communication Complexity of Planarity. |
FCT |
1989 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license