ARAMA SONUÇLARI

Toplam 7 adet sonuçtan 7 tanesi görüntülenmektedir.

Arama









Yıllara göre arama

Özel Aralık Girişi

An improved conference-key agreement protocol for dynamic groups with efficient fault correction
Security and Communication Networks, Vol. 8, No. 7, Mart 2015, s. 1347-1359, ISSN: 19390114
ERMİŞ ORHAN,BAHTİYAR ŞERİF,ANARIM EMİN,ÇAĞLAYAN MEHMET UFUK
Computing with nano-crossbar arrays: Logic synthesis and fault tolerance
Design, Automation Test in Europe Conference Exhibition (DATE), 2017, 27 Mart 2017
ALTUN MUSTAFA,CİRİANİ VALENTİNA,TAHOORİ MEHDİ
Mustafa Altun Tam metin bildiri
Computing with Nano Crossbar Arrays Logic Synthesis and Fault Tolerance
Design, Automation & Test in Europe, 27 Mart 2017
ALTUN MUSTAFA,CİRİANİ VALENTİNA,TAHOORİ MEHDİ
Mustafa Altun Tam metin bildiri
Permanent and Transient Fault Tolerance for Reconfigurable Nano-Crossbar Arrays
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 36, No. 5, Nisan 2017, s. 747-760, ISSN: 0278-0070
TUNALI ONUR,ALTUN MUSTAFA
Mustafa Altun Özgün Makale
Circuit Design Steps for Nano-Crossbar Arrays: Area-Delay-Power Optimization With Fault Tolerance
IEEE Transactions on Nanotechnology, Vol. 20, Ocak 2021, ISSN: 1536-125X
MORGÜL MUHAMMED CEYLAN, FRONTİNİ LUCA, TUNALI ONUR, ANGHEL LORENA, CİRİANİ VALENTİNA, VATAJELU ELENA IOANA, MORİTZ CSABA, STAN MİRCEA, ALEXANDRESCU DAN, ALTUN MUSTAFA
Mustafa Altun Özgün Makale
A Survey of Fault-Tolerance Algorithms for Reconfigurable Nano-Crossbar Arrays
ACM Computing Surveys, Vol. 50, No. 6, Şubat 2018, s. 1-35, ISSN: 0360-0300
TUNALİ ONUR,ALTUN MUSTAFA
Mustafa Altun Derleme Makale
Practical Byzantine Fault Tolerance Based Robustness for Mobile Crowdsensing
ACM Distributed Ledger Technologies: Research and Practice, Vol. 2, No. 2, Haziran 2023, s. 1-24, ISSN: 2769-6472
CHEN ZHIYAN, GÜL ÖMER MELİH, KANTARCI BURAK
Ömer Melih Gül Özgün Makale

İLETİŞİM BİLGİLERİ

İstanbul Teknik Üniversitesi Rektörlüğü İTÜ Ayazağa Kampüsü Rektörlük Binası, Maslak-Sarıyer / İstanbul Tel: +90 212 285 3930