Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
160 | Christian Eisentraut, David Spieler |
Fault, Compensation and Termination in WS-BPEL 2.0 - A Comparative Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WS-FM ![In: Web Services and Formal Methods, 5th International Workshop, WS-FM 2008, Milan, Italy, September 4-5, 2008, Revised Selected Papers, pp. 107-126, 2008, Springer, 978-3-642-01363-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
94 | P. John Paul, P. N. Girija |
A Novel VLSI Architecture for Image Compression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISM ![In: Eigth IEEE International Symposium on Multimedia (ISM 2006), 11-13 December 2006, San Diego, CA, USA, pp. 794-795, 2006, IEEE Computer Society, 0-7695-2746-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
FHT, FCT, FST, Hybrid Transform, VLSI, FFT |
80 | Yufei Tao 0001, Jeffrey Xu Yu |
Finding frequent co-occurring terms in relational keyword search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: EDBT 2009, 12th International Conference on Extending Database Technology, Saint Petersburg, Russia, March 24-26, 2009, Proceedings, pp. 839-850, 2009, ACM, 978-1-60558-422-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
68 | Ferenc Gécseg (eds.) |
Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981 ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![Springer, 3-540-10854-8 The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Dirk Janssens, Grzegorz Rozenberg |
Generating Graph Languages Using Hypergraph Grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 154-164, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Hans Kleine Büning |
Classes of Functions over Binary Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 199-204, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Jirí Adámek |
Observability and Nerode Equivalence in Concrete C5ategories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 1-15, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Magnus Steinby |
Some Algebraic Aspects of Recognizability and Rationality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 360-372, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Juha Kortelainen |
Some Properties of Language Families Generated by Commutative Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 210-217, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Jürgen Dassow |
Equality Languages and Language Families. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 100-109, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Heinz Kaphengst |
What is Computable for Abstract Data Types? ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 173-181, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | H. C. M. Kleijn, Grzegorz Rozenberg |
On the Role of Selectors in Selective Substitution Grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 190-198, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Hagen Huwig |
A Definition of the P=NP-Problem in Categories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 146-153, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Detlef Seese |
Elimination of Second-Order Quantifiers for Well-Founded Trees in Stationary Logic and Finitely Determinate Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 341-349, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | István Németi |
Dynamic Algebras of Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 281-290, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Hans-Dieter Ehrich |
Specifying Algebraic Data Types by Domain Equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 120-129, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Anton Nijholt |
The Equivalence Problem for LL- and LR-Regular Grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 291-300, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Wolfgang Merzenich |
Co-Algebras as Machines for the Interpretations of Flow Diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 250-258, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Piotr W. Prószynski |
Remarks on the Notion of Concurrency Relation in the Case of Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 311-320, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Burkhard Monien |
On the LBA Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 265-280, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Miklós Bartha |
An Algebraic Defenition of Attributed Transformations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 51-60, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Robert P. Daley |
On the Error Correcting Power of Pluralism in Inductive Inference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 90-99, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Zoltán Ésik |
An Axiomatization of Regular Forests in the Language of Algebraic Theories with Iteration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 130-136, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi |
Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 24-33, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Christoph Meinel |
About the by Codings of Environments Induced Posets [az, <=] and [Lz, <=]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 445-452, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Frank Hoffmann |
One Pebble Does Not Suffice to Search Plane Labyrinths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 433-444, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Pavel Goralcik, A. Goralciková, Václav Koubek, Vojtech Rödl |
Fast Recognition of Rings and Lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 137-145, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Ivan Hal Sudborough |
Pebbling and Bandwith. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 373-383, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Hajnal Andréka, István Németi |
Some Universal Algebraic and Model Theoretic Results in Computer Science. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 16-23, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Ales Pultr |
On the Size of Conjunctive Representations of n-ary Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 321-327, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Jirí Vinárek |
Extensions of Symmetric Hom-Functors to the Kleisli Category. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 394-399, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | János Demetrovics, Gyula O. H. Katona |
Extremal Combinatorial Problems in Relational Data Base. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 110-119, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Jerzy W. Jaromczyk |
Lower Bounds for Problems Defined by Polynomial Inequalities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 165-172, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Grzegorz Rozenberg |
On Subwords of Formal Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 328-333, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | László Babai |
Moderately Exponential Bound for Graph Isomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 34-50, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Juhani Karhumäki |
On Strongly Cube-Free Omega-Words Generated by Binary Morphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 182-189, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Bernard Leguy |
Reducing Algebraic Tree Grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 226-233, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Jan Grabowski |
An Algorithm to Identify Slices, with Applications to Vector Replacement Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 425-432, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Stephan Waack |
Tape Complexity of Word Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 467-471, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | György Turán |
On Cellular Graph-Automata and Second-Order Definable Graph-Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 384-393, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | B. Csákány |
Homogenity and Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 81-89, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Peter Burmeister |
Quasi-Equational Logic for Partial Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 71-80, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Friedhelm Meyer auf der Heide, Hans-Anton Rollik |
Random Access Machines and Straight-Line Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 259-264, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Axel Poigné |
Context-Free Languages of Infinite Words As Least Fixpoints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 301-310, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Joffroy Beauquier |
A New Operation Between Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 400-409, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Franz-Josef Brandenburg |
Analogies of PAL and COPY. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 61-70, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Bernhard Korte, László Lovász 0001 |
Mathematical Structures Underlying Greedy Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 205-209, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Jeannine Leguy |
Rational Cone and Substitution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 234-243, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Andrzej Wlodzimierz Mostowski |
The Complexity of Automata and Subtheories of Monadic Second Order Arithmetics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 453-466, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Ludek Kucera, Vera Trnková |
Isomorphism Completeness for Some Algebraic Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 218-225, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Egon Börger |
Logical Description of Computation Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 410-424, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Ildikó Sain |
First Order Dynamic Logic with Decidable Proofs and Workable Model Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 334-340, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Matti Linna |
On the Regularity Problem of SF-Languages Generated by Minimal Linear Grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 244-249, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
68 | Peter H. Starke |
Processes in Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981, pp. 350-359, 1981, Springer, 3-540-10854-8. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
62 | Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot |
(Non)-Approximability for the Multi-criteria TSP(1, 2). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings, pp. 329-340, 2005, Springer, 3-540-28193-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
60 | Michael Breuß, Joachim Weickert |
Highly Accurate PDE-Based Morphology for General Structuring Elements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSVM ![In: Scale Space and Variational Methods in Computer Vision, Second International Conference, SSVM 2009, Voss, Norway, June 1-5, 2009. Proceedings, pp. 758-769, 2009, Springer, 978-3-642-02255-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
60 | Guangyu Huang, Cher Ming Tan |
Reverse Breakdown Voltage Measurement for Power P+NN+ Rectifier. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Electron. Test. ![In: J. Electron. Test. 24(5), pp. 473-479, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Forced voltage test, Forced current test, PIV test, Minimum required test time, Destruction during test |
59 | Hong Yan 0001 |
Detection of Curved Text Path Based on the Fuzzy Curve-Tracing (FCT) Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDAR ![In: 6th International Conference on Document Analysis and Recognition (ICDAR 2001), 10-13 September 2001, Seattle, WA, USA, pp. 266-270, 2001, IEEE Computer Society, 0-7695-1263-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Processing of artistic documents, Extraction of text lines, Fuzzy c-means (FCM) clustering algorithm, Fuzzy curve-tracing (FCT) algorithm, Character recognition, Document image analysis |
53 | André Mateus 0001, Omar Tahri, Pedro Miraldo |
Active Structure-from-Motion for 3D Straight LinesBehaviors* This work was partially supported by the Portuguese FCT grants PD/Bd/135015/2017 (through the NETSys Doctoral Program) & SFRH/BPD/111495/2015, and ISRILARSyS Strategic Funding by the FCT project PEst-OE/EEI/LA0009/2013. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IROS ![In: 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2018, Madrid, Spain, October 1-5, 2018, pp. 5819-5825, 2018, IEEE, 978-1-5386-8094-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
46 | Hong Yan 0001 |
Convergence condition and efficient implementation of the fuzzy curve-tracing (FCT) algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Syst. Man Cybern. Part B ![In: IEEE Trans. Syst. Man Cybern. Part B 34(1), pp. 210-221, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
42 | Henning Fernau, Klaus Jansen (eds.) |
Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![Springer, 978-3-031-43586-7 The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Sewon Park 0001 |
Verified Exact Real Computation with Nondeterministic Functions and Limits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 363-377, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser |
Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 392-405, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Pamela Fleischmann, Jonas Höfer, Annika Huch, Dirk Nowotka |
α-β-Factorization and the Binary Case of Simon's Congruence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 190-204, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Kodai Tanaka, Takaaki Mizuki |
Two UNO Decks Efficiently Perform Zero-Knowledge Proof for Sudoku. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 406-420, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Van Bang Le, Christian Rosenke |
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 348-362, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Jan Matyás Kristan, Jakub Svoboda |
Shortest Dominating Set Reconfiguration Under Token Sliding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 333-347, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu |
On Computing a Center Persistence Diagram. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 262-275, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen |
Computing Subset Vertex Covers in H-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 88-102, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Johanna Björklund |
The Impact of State Merging on Predictive Accuracy in Probabilistic Tree Automata: Dietze's Conjecture Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 74-87, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Antonio Al Serhali, Joachim Niehren |
Subhedge Projection for Stepwise Hedge Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 16-31, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Nathalie Aubrun, Nicolas Bitar |
Domino Snake Problems on Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 46-59, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Jeff Kinne, Akbar Rafiey, Arash Rafiey, Mohammad Sorkhpar |
Vertex Ordering with Precedence Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 304-317, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Samy Abbes |
Convergence of Distributions on Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 1-15, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Zohair Raza Hassan, Edith Hemaspaandra, Stanislaw P. Radziszowski |
The Complexity of (Pk, Pℓ )-Arrowing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 248-261, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | William S. Evans, David G. Kirkpatrick |
Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 162-175, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Daniela Bubboloni, Costanza Catalano, Andrea Marino 0001, Ana Silva 0001 |
On Computing Optimal Temporal Branchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 103-117, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Carlos Alegría, Justin Dallant, Pablo Pérez-Lantero, Carlos Seara |
The Rectilinear Convex Hull of Line Segments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 32-45, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Ajinkya Gaikwad, Soumen Maity |
Parameterized Complexity of the Th+1-Free Edge Deletion Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 221-233, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Feston Kastrati, Wendy J. Myrvold, Lucas D. Panjer, Aaron Williams |
Cordial Forests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 291-303, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Fabian Frei, David Wehner |
Bounds for c-Ideal Hashing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 205-220, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Joshua A. Grochow, Michael Levet |
On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 234-247, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza |
Exact and Parameterized Algorithms for the Independent Cutset Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 378-391, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Dipayan Chakraborty, R. B. Sandeep |
Contracting Edges to Destroy a Pattern: A Complexity Study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 118-131, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Lamar Chidiac, Santiago Guzmán-Pro, Winfried Hochstättler, Anthony Youssef |
An Efficient Computation of the Rank Function of a Positroid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 147-161, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Tomoyuki Yamakami |
Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 421-435, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Martin Berglund, Henrik Björklund, Johanna Björklund |
Parsing Unranked Tree Languages, Folded Once. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 60-73, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Zack Fitzsimmons, Edith Hemaspaandra |
Complexity of Conformant Election Manipulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 176-189, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Chris Köcher, Dietrich Kuske |
Forwards- and Backwards-Reachability for Cooperating Multi-pushdown Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 318-332, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen |
Distance-Based Covering Problems for Graphs of Given Cyclomatic Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 132-146, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Philip Kaelbling, Dakotah Lambert, Jeffrey Heinz |
Robust Identification in the Limit from Incomplete Positive Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings, pp. 276-290, 2023, Springer, 978-3-031-43586-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
42 | Evripidis Bampis, Aris Pagourtzis (eds.) |
Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![Springer, 978-3-030-86592-4 The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
42 | Marc Neveling, Jörg Rothe, Robin Weishaupt |
The Possible Winner Problem with Uncertain Weights Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings, pp. 399-412, 2021, Springer, 978-3-030-86592-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
42 | Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula |
The Complexity of Bicriteria Tree-Depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings, pp. 100-113, 2021, Springer, 978-3-030-86592-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
42 | Nicolas Bousquet, Alice Joffard |
TS-Reconfiguration of Dominating Sets in Circle and Circular-Arc Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings, pp. 114-134, 2021, Springer, 978-3-030-86592-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
42 | Sanjana Dey, Anil Maheshwari, Subhas C. Nandy |
Minimum Consistent Subset Problem for Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings, pp. 204-216, 2021, Springer, 978-3-030-86592-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
42 | Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi |
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings, pp. 162-175, 2021, Springer, 978-3-030-86592-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
42 | Jin-Yi Cai, Austen Z. Fan, Yin Liu |
Bipartite 3-Regular Counting Problems with Mixed Signs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings, pp. 135-148, 2021, Springer, 978-3-030-86592-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
42 | Kyrill Winkler, Ulrich Schmid 0001, Thomas Nowak |
Valency-Based Consensus Under Message Adversaries Without Limit-Closure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings, pp. 457-474, 2021, Springer, 978-3-030-86592-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
42 | Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman 0001 |
Faster FPT Algorithms for Deletion to Pairs of Graph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings, pp. 314-326, 2021, Springer, 978-3-030-86592-4. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|