Search results for "IMYCS"

Hits ?▲	Authors	Title	Venue	Year	Link
1	Marta Franová	Constructive Matching - Explanation Based Methodology for Inductive Theorem Proving.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Peter Rajcáni	Optimal Parallel 3-Colouring Algorithm for Rooted Trees and Its Application.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Kristel Unger	A New Method for Proving Lower Bounds in the Model of Algebraic Decision Trees.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Klaus Reinhardt	Hierarchies over the Context-Free Languages.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Andreas Goerdt, Helmut Seidl	Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Martin Fodslette Møller	Learning by Conjugate Gradients.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Marcella Anselmo	Two-Way Reading on Words.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Ildikó Sain	Past Proves More Invariance Properties but not PCA's.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Christian B. Suttner	Representing Heuristic-Relevant Information for an Automated Theorem Prover.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Maryse Pelletier	Monoids Described by Pushdown Automata.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Carsten Damm	Problems Complete for +L.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Peter Skodný	Remarks on the Frequency-Coded Neural Nets Complexity.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Ralf Stiebe	Picture Generation Using Matrix Systems.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Patrice Séébold, Karine Slowinski	Minimizing Picture Words.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Karel Culík II, Simant Dube	Methods for Generating Deterministic Fractals and Image Compression.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Lila Santean	A Hierarchy of Unary Primitive Recursive String-Functions.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Jean-Luc Coquidé, Rémi Gilleron	Proofs and Reachablity Problem for Ground Rewrite Systems.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Juraj Wiedermann	Complexity Issues in Discrete Neurocomputing.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Dominik Gomm, Rolf Walter	The Distributed Termination Problem: Formal Solution and Correctness Based on Petri Nets.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Bin Cong, Zevi Miller, Ivan Hal Sudborough	Optimum Simulation of Meshes by Small Hypercubes.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Yves Kodratoff	Seven Hard Problems in Symbolic Background Knowledge Acquisition.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Jürgen Dassow, Jozef Kelemen (eds.)	Aspects and Prospects of Theoretical Computer Science, 6th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November 19-23, 1990, Proceedings	IMYCS	1990	DBLP DOI BibTeX RDF
1	Juraj Waczulík	Area Time Squared and Area Complexity of VLSI Computations is Strongly Unclosed Under Union and Intersection.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Martin Loebl	Greedy Compression Systems.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Michael Mñuk	A Div(n) Depth Boolean Circuit for Smooth Modular Inverse.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Christophe Reutenauer	Subsequential Functions: Characterizations, Minimization, Examples.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Igor Walukiewicz	Decision Procedure for Checking Validity of PAL Formulas.	IMYCS	1990	DBLP DOI BibTeX RDF
1	Jürgen Dassow, Jozef Kelemen (eds.)	Machines, Languages, and Complexity, 5th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November 14-18, 1988, Proceedings	IMYCS	1989	DBLP DOI BibTeX RDF
1	Klaus-Jörn Lange	Complexity Theory and Formal Languages.	IMYCS	1988	DBLP DOI BibTeX RDF
1	Galina Jirásková	Chomsky Hierarchy and Communication Complexity.	IMYCS	1988	DBLP DOI BibTeX RDF
1	Daniele Cortolezzis	The Virtual Floating Grid File.	IMYCS	1988	DBLP DOI BibTeX RDF
1	Klaus P. Jantke	Algorithmic Learning from Incomplete Information - Principles and Problems.	IMYCS	1988	DBLP DOI BibTeX RDF
1	Derick Wood	The Riches of Rectangles.	IMYCS	1988	DBLP DOI BibTeX RDF
1	Frank van Harmelen	The Limitations of Partial Evaluation.	IMYCS	1988	DBLP DOI BibTeX RDF
1	Jarkko Kari	A Cryptosystem Based on Propositional Logic.	IMYCS	1988	DBLP DOI BibTeX RDF
1	Carlo Gaibisso	A Partially Persistent Data Structure for the Set-Union Problem with Backtracking.	IMYCS	1988	DBLP DOI BibTeX RDF
1	Akira Ito, Katsushi Inoue, Itsuo Takanami	The Simulation of Two-Dimensional One-Marker Automata by Three-Way Turing Machines.	IMYCS	1988	DBLP DOI BibTeX RDF
1	Kristel Unger	The Convex Hull Problem on Grides - Computational and Combinatorial Aspects.	IMYCS	1988	DBLP DOI BibTeX RDF
1	Katsushi Inoue, Itsuo Takanami	A Survey of Two-Dimensional Automata Theory.	IMYCS	1988	DBLP DOI BibTeX RDF
1	Mirko Krivánek	A Note on the Computational Complexity of Bracketing and Related Problems.	IMYCS	1988	DBLP DOI BibTeX RDF
1	Martin Loebl, Jaroslav Nesetril	Postorder Hierarchy for Path Compressions and Set Union.	IMYCS	1988	DBLP DOI BibTeX RDF
1	Michel Latteux	Rational Cones and Commutations.	IMYCS	1988	DBLP DOI BibTeX RDF
1	Anna Slobodová	Some Properties of Space-Bounded Synchronized Alternating Turing Machines with Only Universal States.	IMYCS	1988	DBLP DOI BibTeX RDF
1	Friedhelm Hinz	Questions of Decidability for Context-free Chain Code Picture Languages.	IMYCS	1988	DBLP DOI BibTeX RDF
1	Arto Salomaa	Cryptography and Data Security.	IMYCS	1988	DBLP DOI BibTeX RDF
1	Bernd Reichel	A Remark on Some Classifications of Indian Parallel Languages.	IMYCS	1988	DBLP DOI BibTeX RDF
1	Zoltán Ésik	An Extension of the Krohn-Rhodes Decomposition of Automata.	IMYCS	1988	DBLP DOI BibTeX RDF
1	Alica Kelemenová, Jozef Kelemen (eds.)	Trends, Techniques, and Problems in Theoretical Computer Science, 4th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, October 13-17, 1986, Proceedings	IMYCS	1987	DBLP DOI BibTeX RDF
1	Juhani Karhumäki	The equivalence of mappings on languages.	IMYCS	1986	DBLP DOI BibTeX RDF
1	H. C. M. Kleijn	Basic ideas of selective substitution grammars.	IMYCS	1986	DBLP DOI BibTeX RDF
1	Gheorghe Paun	Some recent restrictions in the derivation of context-free grammars.	IMYCS	1986	DBLP DOI BibTeX RDF
1	Juraj Hromkovic	Lower bound techniques for VLSI algorithms.	IMYCS	1986	DBLP DOI BibTeX RDF
1	Mária Králová	A note on the ratio function in DOL Systems.	IMYCS	1986	DBLP DOI BibTeX RDF
1	Frederick N. Springsteel	Basic complexity analysis of hypothesis formation.	IMYCS	1986	DBLP DOI BibTeX RDF
1	Jacques Sakarovitch	Kleene's theorem revisited.	IMYCS	1986	DBLP DOI BibTeX RDF
1	Aristid Lindenmayer	Models for multicellular development: Characterization, inference and complexity of L-systems.	IMYCS	1986	DBLP DOI BibTeX RDF
1	Victor Aladyev	Recent results on the theory of homogeneous structures.	IMYCS	1986	DBLP DOI BibTeX RDF
1	Ivan Kalas	A formal model of knowledge-based systems.	IMYCS	1986	DBLP DOI BibTeX RDF
1	Zsolt Tuza	Some combinatorial problems concerning finite languages.	IMYCS	1986	DBLP DOI BibTeX RDF
1	Péter Szeredi	Perspectives of logic programming.	IMYCS	1986	DBLP DOI BibTeX RDF
1	Erzsébet Csuhaj-Varjú	A connection between descriptional complexity of context-free grammars and grammar form theory.	IMYCS	1986	DBLP DOI BibTeX RDF

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