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
[1]
Hilfe
Suche: Journal=J. Comput.~Syst.~Sci. AND Volume=78
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Multi-valued model checking games
Sharon Shoham
,
Orna Grumberg
Journal of Computer and System Sciences
78
(2), 2012, pp. 414-429
Solving parity games by a reduction to SAT
Keijo Heljanko
,
Misa Keinänen
,
Martin Lange
,
Ilkka Niemelä
Journal of Computer and System Sciences
78
(2), 2012, pp. 430-440
Finding and fixing faults
Barbara Jobstmann
,
Stefan Staber
,
Andreas Griesmayer
,
Roderick Bloem
Journal of Computer and System Sciences
78
(2), 2012, pp. 441-460
Model-checking hierarchical structures
Markus Lohrey
Journal of Computer and System Sciences
78
(2), 2012, pp. 461-490
Drawing a tree as a minimum spanning tree approximation
Emilio Di Giacomo
,
Walter Didimo
,
Giuseppe Liotta
,
Henk Meijer
Journal of Computer and System Sciences
78
(2), 2012, pp. 491-503
Representations of commutative asynchronous automata
Jing Tian
,
Xianzhong Zhao
Journal of Computer and System Sciences
78
(2), 2012, pp. 504-516
Schützenberger and Eilenberg theorems for words on linear orderings
Nicolas Bedon
,
Chloé Rispal
Journal of Computer and System Sciences
78
(2), 2012, pp. 517-536
Size complexity of rotating and sweeping automata
Christos Kapoutsis
,
Richard Královic̑
,
Tobias Mömke
Journal of Computer and System Sciences
78
(2), 2012, pp. 537-558
On making directed graphs transitive
Mathias Weller
,
Christian Komusiewicz
,
Rolf Niedermeier
,
Johannes Uhlmann
Journal of Computer and System Sciences
78
(2), 2012, pp. 559-574
Parallel modular exponentiation using load balancing without precomputation
Pedro Lara
,
Fábio Borges
,
Renato Portugal
,
Nadia Nedjah
Journal of Computer and System Sciences
78
(2), 2012, pp. 575-582
A structural/temporal query language for Business Processes
Daniel Deutch
,
Tova Milo
Journal of Computer and System Sciences
78
(2), 2012, pp. 583-609
On sets without
k
-term arithmetic progression
Zehui Shao
,
Fei Deng
,
Meilian Liang
,
Xiaodong Xu
Journal of Computer and System Sciences
78
(2), 2012, pp. 610-618
Ultra-succinct representation of ordered trees with applications
Jesper Jansson
,
Kunihiko Sadakane
,
Wing-Kin Sung
Journal of Computer and System Sciences
78
(2), 2012, pp. 619-631
Approximate shortest paths in weighted graphs
Raphael Yuster
Journal of Computer and System Sciences
78
(2), 2012, pp. 632-637
Enumerating homomorphisms
Andrei A. Bulatov
,
Víctor Dalmau
,
Martin Grohe
,
Dániel Marx
Journal of Computer and System Sciences
78
(2), 2012, pp. 638-650
Two-server password-only authenticated key exchange
Jonathan Katz
,
Philip MacKenzie
,
Gelareh Taban
,
Virgil Gligor
Journal of Computer and System Sciences
78
(2), 2012, pp. 651-669
A linear time algorithm for the induced disjoint paths problem in planar graphs
Ken-ichi Kawarabayashi
,
Yusuke Kobayashi
Journal of Computer and System Sciences
78
(2), 2012, pp. 670-680
The complexity of weighted and unweighted \#CSP
Andrei Bulatov
,
Martin Dyer
,
Leslie Ann Goldberg
,
Markus Jalsenius
,
Mark Jerrum
,
David Richerby
Journal of Computer and System Sciences
78
(2), 2012, pp. 681-688
Approximability of constrained LCS
Minghui Jiang
Journal of Computer and System Sciences
78
(3), 2012, pp. 689-697
Faster algorithms for finding and counting subgraphs
Fedor V. Fomin
,
Daniel Lokshtanov
,
Venkatesh Raman
,
Saket Saurabh
,
B.V. Raghavendra Rao
Journal of Computer and System Sciences
78
(3), 2012, pp. 698-706
Local search: Is brute-force avoidable?
Michael R. Fellows
,
Fedor V. Fomin
,
Daniel Lokshtanov
,
Frances Rosamond
,
Saket Saurabh
,
Yngve Villanger
Journal of Computer and System Sciences
78
(3), 2012, pp. 707-719
An improved approximation algorithm for the complementary maximal strip recovery problem
Guohui Lin
,
Randy Goebel
,
Zhong Li
,
Lusheng Wang
Journal of Computer and System Sciences
78
(3), 2012, pp. 720-730
Fixed-point tile sets and their applications
Bruno Durand
,
Andrei Romashchenko
,
Alexander Shen
Journal of Computer and System Sciences
78
(3), 2012, pp. 731-764
Space complexity of perfect matching in bounded genus bipartite graphs
Samir Datta
,
Raghav Kulkarni
,
Raghunath Tewari
,
N.V. Vinodchandran
Journal of Computer and System Sciences
78
(3), 2012, pp. 765-779
On CD-systems of stateless deterministic R-automata with window size one
Benedek Nagy
,
Friedrich Otto
Journal of Computer and System Sciences
78
(3), 2012, pp. 780-806
Seiten
<
1
2
3
4
5
>