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 YEAR=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Covering of transient simulation of feedback-free circuits by binary analysis
Yuli Ye
,
Janusz Brzozowski
International Journal of Foundations of Computer Science
17
(4), 2006, pp. 949-973
Spike trains in spiking neural
P
systems
Gheorghe Păun
,
Mario J. Pérez-Jiménez
,
Grzegorz Rozenberg
International Journal of Foundations of Computer Science
17
(5), 2006, pp. 975-1002
Planar crossing numbers of graphs embeddable in another surface
Károly J. Böröczky
,
János Pach
,
Géza Tóth
International Journal of Foundations of Computer Science
17
(5), 2006, pp. 1005-1015
Trémaux trees and planarity
Hubert de Fraysseix
,
Patrice Ossona de Mendez
,
Pierre Rosenstiehl
International Journal of Foundations of Computer Science
17
(5), 2006, pp. 1017-1029
Convex grid drawings of four-connected plane graphs
Kazuyuki Miura
,
Shin-Ichi Nakano
,
Takao Nishizeki
International Journal of Foundations of Computer Science
17
(5), 2006, pp. 1031-1060
On extending a partial straight-line drawing
Maurizio Patrignani
International Journal of Foundations of Computer Science
17
(5), 2006, pp. 1061-1069
On embedding a graph on two sets of points
Emilio di Giacomo
,
Giuseppe Liotta
,
Francesco Trotta
International Journal of Foundations of Computer Science
17
(5), 2006, pp. 1071-1094
Two fixed-parameter tractable algorithms for testing upward planarity
Patrick Healy
,
Karol Lynch
International Journal of Foundations of Computer Science
17
(5), 2006, pp. 1095-1114
Convex drawings of plane graphs of minimum outer apices
Kazuyuki Miura
,
Machiko Azuma
,
Takao Nishizeki
International Journal of Foundations of Computer Science
17
(5), 2006, pp. 1115-1127
An application of well-orderly trees in graph drawing
Huaming Zhang
,
Xin He
International Journal of Foundations of Computer Science
17
(5), 2006, pp. 1129-1141
Drawing with fat edges
Christian A. Duncan
,
Alon Efrat
,
Stephen Kobourov
,
Carola Wenk
International Journal of Foundations of Computer Science
17
(5), 2006, pp. 1143-1163
Packing soft rectangles
Hiroshi Nagamochi
International Journal of Foundations of Computer Science
17
(5), 2006, pp. 1165-1178
On the complexity of counting fixed points and gardens of Eden in sequential dynamical systems on planar bipartite graphs
Predrag T. Tos̑ić
International Journal of Foundations of Computer Science
17
(5), 2006, pp. 1179-1203
Resilient LKH: Secure multicast key distribution schemes
Reihaneh Safavi-Naini
,
Huaxiong Wang
,
Duncan S. Wong
International Journal of Foundations of Computer Science
17
(5), 2006, pp. 1205-1221
Generation of languages by rewriting systems that resemble automata
Zbynȇk Kȓivka
,
Alexander Meduna
,
Rudolf Schönecker
International Journal of Foundations of Computer Science
17
(5), 2006, pp. 1223-1229
Erratum to ''Representation of semiautomata by canonical words and equivalences''
Janusz Brzozowski
,
Helmut Jürgensen
International Journal of Foundations of Computer Science
17
(6), 2006, pp. 1231-1232
A space efficient bit-parallel algorithm for the multiple string matching problem
Domenico Cantone
,
Simone Faro
International Journal of Foundations of Computer Science
17
(6), 2006, pp. 1235-1251
Two related algorithms for root-to-frontier tree pattern matching
Loek Cleophas
,
Kees Hemerik
,
Gerard Zwaan
International Journal of Foundations of Computer Science
17
(6), 2006, pp. 1253-1272
Bounded size dictionary compression: Relaxing the LRU deletion heuristic
Sergio de Agostino
International Journal of Foundations of Computer Science
17
(6), 2006, pp. 1273-1280
Reconstructing a suffix array
Frantisek Franek
,
William F. Smyth
International Journal of Foundations of Computer Science
17
(6), 2006, pp. 1281-1295
Compressed pattern matching in JPEG images
Shmuel T. Klein
,
Dana Shapira
International Journal of Foundations of Computer Science
17
(6), 2006, pp. 1297-1306
Dynamic allocation of finite automata states for fast string recognition
Ernest Ketcha Ngassam
,
Bruce W. Watson
,
Derrick G. Kourie
International Journal of Foundations of Computer Science
17
(6), 2006, pp. 1307-1323
Bit-parallel computation of local similarity score matrices with unitary weights
Heikki Hyyrö
,
Gonzalo Navarro
International Journal of Foundations of Computer Science
17
(6), 2006, pp. 1325-1344
Flexible music retrieval in sublinear time
Kimmo Fredriksson
,
Veli Mäkinen
,
Gonzalo Navarro
International Journal of Foundations of Computer Science
17
(6), 2006, pp. 1345-1364
A simple alphabet-independent FM-index
Szymon Grabowski
,
Gonzalo Navarro
,
Rafaƚ Przywarski
,
Alejandro Salinger
,
Veli Mäkinen
International Journal of Foundations of Computer Science
17
(6), 2006, pp. 1365-1384
Seiten
<
1
2
3
4
>