Mäkinen, Erkki

name

• Mäkinen, Erkki

Authored works

• A genetic algorithm for determining the thickness of a graph
• A linear time and space algorithm for finding isomorphic subtrees of a binary tree
• A note on linear search heuristics
• A note on Rémy's algorithm for generating random binary trees
• A note on sequential access in splay trees
• A note on the equivalence problem of Szilard languages
• A note on the grammatical inference problem for even linear languages
• A note on the inclusion problem for Szilard languages
• A note on the median heuristic for drawing bipartite graphs
• A survey on binary tree codings
• Algoritmien suunnittelu ja analyysi
• An implicit data structure for supporting some tree operations
• Binary tree code words as context-free languages
• Constructing a binary tree efficiently from its traversals
• Constructing a binary tree from its traversals
• Experiments on drawing 2-level hierarchical graphs
• Generating random binary trees : a survey
• Genetic algorithms for drawing bipartite graphs
• How to draw a hypergraph
• Implementing minimally adequate syntheziser
• Inferring finite transducers
• Inferring regular languages by merging nonterminals
• Inferring uniq[ue]ly te[rm]inating regular languages from positive data
• Laskennan teorian perusteet
• Left distance binary tree representations
• Minimally adequate teacher designs software
• Normal forms for pure context-free grammars
• Notes on derivation languages
• On circular layouts
• On context-free derivations
• On drawing regular bipartite graphs
• On fair derivations
• On homomorphic images of left Szilard languages
• On implementing two adaptive data compression schemes
• On inferring linear single-tree languages
• On inferring zero-reversible languages
• On lexicographic enumeration of regular and context-free languages
• On permutative grammars generating context-free languages
• On pure context-free languages and left Szilard languages
• On Szilard languages of pure context-free grammars
• On the [epsilon]-free covering of LR(K) grammars
• On the inclusion problem for very simple deterministic pushdown automata
• On the longest upsequence problem for permutations
• On the subtree isomorphism problem for ordered trees
• Pattern ambiguities for pure context-free grammars
• Ranking and unranking left szilard languages
• Remarks on the assignment heuristic for drawing bipartite graphs
• Splay trees as priority queues
• The grammatical inference problem for the Szilard languages of linear grammars
• Two complexity measures for context-free languages
• Vasemmista Szilardin kielistä ja kielioppien samankaltaisuudesta

Works contributed to

• A comparison of random binary tree generators
• A note on Cohen's formal model for computer viruses
• A note on SE-systems and regular canonical systems
• A note on synchronized extension systems
• A note on the complexity of trie compaction
• Algoritmien suunnittelu ja analyysi
• Brief studies in computer science (fall 2003)
• Development of program visualization systems
• Inferring pure context-free languages from positive data
• Inferring state machines from trace diagrams
• IOI'01 competition
• IOI'01 competition, Tampere, Finland
• Jumping Petri nets : specific properties
• Laskennan teorian perusteet
• Notes on distance-based coding methods for binary trees
• On a grammar transformation related to class hierarchies
• On SE-systems and monadic string rewrit[i]ng systems
• On the complexity of a problem on monadic string rewriting systems
• Pieniä tietojenkäsittelytieteellisiä tutkimuksia (kevät 2003)
• Pieniä tietojenkäsittelytieteellisiä tutkimuksia (kevät 2004)
• Pieniä tietojenkäsittelytieteellisiä tutkimuksia (syksy 2001)
• Pieniä tietojenkäsittelytieteellisiä tutkimuksia (syksy 2002)
• Pieniä tietojenkäsittelytieteellisiä tutkimuksia : (syksy 2003)
• SE-systems, timing mechanisms, and time-varying codes
• Synchronized extension systems
• The stable roommates problem and chess tournament pairings
• Tietokone Suomessa 30 vuotta : näkökulmia tietotekniikan tutkimukseen
• TimGA : a genetic algorithm for drawing undirected graphs

Works about Mäkinen, Erkki