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=International Journal of Foundations of Computer Science AND Volume=14
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A new approach to efficient channel assignment for hexagonal cellular networks
Sasthi C. Ghosh
,
Bhabani P. Sinha
,
Nabanita Das
International Journal of Foundations of Computer Science
14
(3), 2003, pp. 439-463
Supernode binary search trees
Haejae Jung
,
Sartaj Sahni
International Journal of Foundations of Computer Science
14
(3), 2003, pp. 465-490
M-heap: A modified heap data structure
S. Bansal
,
S. Sreekanth
,
P. Gupta
International Journal of Foundations of Computer Science
14
(3), 2003, pp. 491-502
On source-based route computation for quickest paths under dynamic bandwidth constraints
William C. Grimmell
,
Nageswara S.V. Rao
International Journal of Foundations of Computer Science
14
(3), 2003, pp. 503-523
On reasoning about rings
E. Allen Emerson
,
Kedar S. Namjoshi
International Journal of Foundations of Computer Science
14
(4), 2003, pp. 527-549
A generic approach to the static analysis of concurrent programs with procedures
Ahmed Bouajjani
,
Javier Esparza
,
Tayssir Touili
International Journal of Foundations of Computer Science
14
(4), 2003, pp. 551-582
Abstraction and counterexample-guided refinement in model checking of hybrid systems
Edmund Clarke
,
Ansgar Fehnker
,
Zhi Han
,
Bruce Krogh
,
Joël Ouaknine
,
Olaf Stursberg
,
Michael Theobald
International Journal of Foundations of Computer Science
14
(4), 2003, pp. 583-604
Efficient symbolic representations for arithmetic constraints in verification
Constantinos Bartzis
,
Tevfik Bultan
International Journal of Foundations of Computer Science
14
(4), 2003, pp. 605-624
A logical characterisation of event clock automata
Deepak D'souza
International Journal of Foundations of Computer Science
14
(4), 2003, pp. 625-639
Characterizing liveness monotonicity for weighted Petri nets in terms of siphon-based properties
Li Jiao
,
To-Yat Cheung
International Journal of Foundations of Computer Science
14
(4), 2003, pp. 641-658
A completely verified realistic bootstrap compiler
Axel Dold
,
Friedrich von Henke
,
Wolfgang Goerigk
International Journal of Foundations of Computer Science
14
(4), 2003, pp. 659-680
Distributed
\omega
-automata
Kamala Krithivasan
,
K. Sharda
,
Sandeep V. Varma
International Journal of Foundations of Computer Science
14
(4), 2003, pp. 681-698
The equivalence problem of finite substitutions on ab*c, with applications
J. Karhumäki
,
L.P. Lisovik
International Journal of Foundations of Computer Science
14
(4), 2003, pp. 699-710
An improved quantum scheduling algorithm
Lov K. Grover
International Journal of Foundations of Computer Science
14
(5), 2003, pp. 715-721
Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem
Gábor Ivanyos
,
Frédéric Magniez
,
Miklos Santha
International Journal of Foundations of Computer Science
14
(5), 2003, pp. 723-739
Encryption of quantum information
Jan Bouda
,
Vladimí R. Buz̑ek
International Journal of Foundations of Computer Science
14
(5), 2003, pp. 741-755
Efficient quantum circuits for non-qubit quantum error-correcting codes
Markus Grassl
,
Martin Rötteler
,
Thomas Beth
International Journal of Foundations of Computer Science
14
(5), 2003, pp. 757-775
Quantum software reusability
Andreas Klappenecker
,
Martin Rötteler
International Journal of Foundations of Computer Science
14
(5), 2003, pp. 777-796
Separability of pure
N
-qubit states: Two characterizations
Philippe Jorrand
,
Mehdi Mhalla
International Journal of Foundations of Computer Science
14
(5), 2003, pp. 797-814
Analysis of quantum functions
Tomoyuki Yamakami
International Journal of Foundations of Computer Science
14
(5), 2003, pp. 815-852
Quantum computation with restricted amplitudes
Harumichi Nishimura
International Journal of Foundations of Computer Science
14
(5), 2003, pp. 853-870
Golomb rulers and difference sets for succinct quantum automata
Alberto Bertoni
,
Carlo Mereghetti
,
Beatrice Palano
International Journal of Foundations of Computer Science
14
(5), 2003, pp. 871-888
On the computational power of physical interactions: Bounds on the number of time steps for simulating arbitrary interaction graphs
Dominik Janzing
,
Pawel Wocjan
,
Thomas Beth
International Journal of Foundations of Computer Science
14
(5), 2003, pp. 889-903
Partitioning 3D phantoms into homogeneous cuboids
Anuj Jain
,
Sartaj Sahni
,
Jatinder Palta
,
James Dempsey
International Journal of Foundations of Computer Science
14
(5), 2003, pp. 905-931
A robust DNA computation model that captures PSPACE
Evgeny Dantsin
,
Alexander Wolpert
International Journal of Foundations of Computer Science
14
(5), 2003, pp. 933-951
Seiten
<
1
2
3
>