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
[2]
Hilfe
Suche: Journal=International Journal of Foundations of Computer Science AND YEAR=2008
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Using scattered mobile agents to locate a black hole in an un-oriented ring with tokens
Stefan Dobrev
,
Nicola Santoro
,
Wei Shi
International Journal of Foundations of Computer Science
19
(6), 2008, pp. 1355-1372
A new FM screening method to generate cluster-dot binary images using the local exhaustive search with FPGA acceleration
Yasuaki Ito
,
Koji Nakano
International Journal of Foundations of Computer Science
19
(6), 2008, pp. 1373-1386
Analysis of the average execution time for a self-stabilizing leader election algorithm
José Alberto Fernández-Zepeda
,
Juan Paulo Alvarado-Magaña
International Journal of Foundations of Computer Science
19
(6), 2008, pp. 1387-1402
Generalized counters and reversal complexity
M.V. Panduranga Rao
International Journal of Foundations of Computer Science
19
(6), 2008, pp. 1403-1412
Matching preclusion for alternating group graphs and their generalizations
Eddie Cheng
,
Linda Lesniak
,
Marc J. Lipman
,
László Lipták
International Journal of Foundations of Computer Science
19
(6), 2008, pp. 1413-1437
Remarks on two nonstandard versions of periodicity in words
F. Blanchet-Sadri
,
L. Bromberg
,
K. Zipple
International Journal of Foundations of Computer Science
19
(6), 2008, pp. 1439-1448
Separation between classical and quantum winning strategies for the matching game
Ivan Fialík
International Journal of Foundations of Computer Science
19
(6), 2008, pp. 1449-1459
A systematic scan for 7-colourings of the GRID
Markus Jalsenius
,
Kasper Pedersen
International Journal of Foundations of Computer Science
19
(6), 2008, pp. 1461-1477
Seiten
<
1
2
3
4