Your search for 38949 returns 3593 document(s) |
Algorithm refinement with read and write frames, (LNCS-Lecture Notes in Computer Science 670) Hal 148-161 |
Author: Juan Bicarregui; | Call Number: 004 Woo f | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Fault tolerant secure routing in cluster based mobile sensor networks, (LNCS-Lecture Notes in Computer Science 5576) Hal 722-731 |
Author: Usama Ahmed; Muhammad Arif Wahla; Firdous Kausar; | Call Number: 005.8 Adv | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Differential fault analysis on A.E.S, (LNCS-Lecture Notes in Computer Science 2576) Hal 293-306 |
Author: Pierre Dusart; Gilles Letourneux; Olivier Vivolo; | Call Number: 005.8 Zho a | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Invariant-based synthesis of fault-tolerant systems, (LNCS-Lecture Notes in Computer Science 1926) Hal 46-57 |
Author: K. Lano; David Clark; K. Androutsopoulos; P. Kan; | Call Number: 004.33 Jos f | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Formal verification for fault-tolerant architectures: some lessons learned, (LNCS-Lecture Notes in Computer Science 670) Hal 482-500 |
Author: Sam Owre; John Rushby; Natarajan Shankar; Friedrich von Henke; | Call Number: 004 Woo f | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Using sat in qbf, (LNCS-Lecture Notes in Computer Science 3709) Hal 578-592 |
Author: Horst Samulowitz; Fahiem Bacchus; | Call Number: 005.133 Bee P | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Model checking for infinite state systems using data abstraction, assumption-commitment style reasoning and theorem proving, (LNCS-Lecture Notes in Computer Science 939) Hal 54-69 |
Author: Jurgen Dingel; Thomas Filkorn; | Call Number: 004 Int c | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
Computer-oriented calculi sequent trees, The relative complexity of updates for a class of database views, LNCS-Lecture Notes in Computer Science 2942), Hal. 213-230 |
Author: Alexander Lyaletski; | Call Number: 006.33 Sei f | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
A New approach to belief modelling, The relative complexity of updates for a class of database views, LNCS-Lecture Notes in Computer Science 2942), Hal. 196-212 |
Author: V.N. Hynh, Y.Nakamori, T. Murai, and TB. Ho; | Call Number: 006.33 Sei f | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|
on Updates of logic programs: a properties-based approach, The relative complexity of updates for a class of database views, LNCS-Lecture Notes in Computer Science 2942) Hal.231-251 |
Author: Mauricio Osorio and Fernando Zacarias; | Call Number: 006.33 Sei f | Type: Indeks Artikel LNCS
|
Find Similar |
Add To Favorites |
Detail in New Window
|