Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=International Journal of Foundations of Computer Science AND Volume=7
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Steiner points in the space of genome rearrrangements
David Sankoff
,
Gopalakrishnan Sundaram
,
John Kececioglu
International Journal of Foundations of Computer Science
7
(1), 1996, pp. 1-9
Simple algorithms for perfect phylogeny and triangulating colored graphs
Richa Agarwala
,
David Fernández-Baca
International Journal of Foundations of Computer Science
7
(1), 1996, pp. 11-21
Alignment-to-alignment editing with ``move gap'' operations
Martin Fürer
,
Webb Miller
International Journal of Foundations of Computer Science
7
(1), 1996, pp. 23-41
On the editing distance between undirected acyclic graphs
Kaizhong Zhang
,
Jason T.L. Wang
,
Dennis Shasha
International Journal of Foundations of Computer Science
7
(1), 1996, pp. 43-57
On finding topologically valid matchings in restriction-fragment maps
Liz Hanks
,
Ron K. Cytron
,
Will Gillett
International Journal of Foundations of Computer Science
7
(1), 1996, pp. 59-86
Covering a circular string with substrings of fixed length
Art M. Duval
,
W.F. Smyth
International Journal of Foundations of Computer Science
7
(1), 1996, pp. 87-93
Linear-time algorithms for disjoint two-face paths problems in planar graphs
Heike Ripphausen-Lipa
,
Dorothea Wagner
,
Karsten Weihe
International Journal of Foundations of Computer Science
7
(2), 1996, pp. 95-110
Treewidth of circle graphs
T. Kloks
International Journal of Foundations of Computer Science
7
(2), 1996, pp. 111-120
Constructing degree-3 spanners with other sparseness properties
Gautam Das
,
Paul J. Heffernan
International Journal of Foundations of Computer Science
7
(2), 1996, pp. 121-135
A simple balanced search tree with
O(1)
worst-case update time
Rudolf Fleischer
International Journal of Foundations of Computer Science
7
(2), 1996, pp. 137-149
An effective Cauchy-Peano existence theorem for unique solutions
Keijo Ruohonen
International Journal of Foundations of Computer Science
7
(2), 1996, pp. 151-160
Subtree isomorphism is in DLOG for nested trees
Raymond Greenlaw
International Journal of Foundations of Computer Science
7
(2), 1996, pp. 161-167
Efficient rebalancing of B-trees with relaxed balance
Kim S. Larsen
,
Rolf Fagerberg
International Journal of Foundations of Computer Science
7
(2), 1996, pp. 169-186
Inductive inference of limiting programs with bounded number of mind changes
Juris Vīksna
International Journal of Foundations of Computer Science
7
(3), 1996, pp. 187-208
Storage overhead of O-trees, B-trees and prefix B-trees: A comparative analysis
Ratko Orlandic
,
Hosam M. Mahmoud
International Journal of Foundations of Computer Science
7
(3), 1996, pp. 209-226
Optimal operations on red-black trees
Lin Chen
,
René Schott
International Journal of Foundations of Computer Science
7
(3), 1996, pp. 227-239
Safe Turing machines, Grzegorczyk classes and polytime
Salvatore Caporaso
International Journal of Foundations of Computer Science
7
(3), 1996, pp. 241-252
Multi-push-down languages and grammars
Luca Breveglieri
,
Alessandra Cherubini
,
Claudio Citrini
,
Stefano Crespi Reghizzi
International Journal of Foundations of Computer Science
7
(3), 1996, pp. 253-291
Depth and path length of heap ordered trees
Helmut Prodinger
International Journal of Foundations of Computer Science
7
(3), 1996, pp. 293-299
An algorithm for finding a maximum cycle of bipartite graphs with large degrees
Pak-Ken Wong
International Journal of Foundations of Computer Science
7
(4), 1996, pp. 301-307
Families of noncounting languages and their learnability from positive data
Satoshi Kobayshi
,
Takashi Yokomori
International Journal of Foundations of Computer Science
7
(4), 1996, pp. 309-327
A note on multihead finite-state automata
Ioan I. Macarie
International Journal of Foundations of Computer Science
7
(4), 1996, pp. 329-337
On the isomorphism conjecture for 2-DFA reductions
Manindra Agrawal
,
S. Venkatesh
International Journal of Foundations of Computer Science
7
(4), 1996, pp. 339-352
Scheduling two salesmen in a network
William F. Klostermeyer
International Journal of Foundations of Computer Science
7
(4), 1996, pp. 353-358
On the propositional SLDNF-resolution
Jan A. Plaza
International Journal of Foundations of Computer Science
7
(4), 1996, pp. 359-406