Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Geoff V. Merrett

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Ali Khiat

> Home > Persons > Geoff V. Merrett

Publications

2019
[j30]
- view
  authority control:
- export record
  dblp key:
  - journals/tcas/Papandroulidakis19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcas/Papandroulidakis19
Georgios Papandroulidakis, Alexander Serb, Ali Khiat, Geoff V. Merrett, Themis Prodromakis:
Practical Implementation of Memristor-Based Threshold Logic Gates. IEEE Trans. Circuits Syst. I Regul. Pap. 66-I(8): 3041-3051 (2019)
[c66]
- view
  authority control:
- export record
  dblp key:
  - conf/iscas/Papandroulidakis19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iscas/Papandroulidakis19
Georgios Papandroulidakis, Loukas Michalas, Alexander Serb, Ali Khiat, Geoff V. Merrett, Themistoklis Prodromakis:
A Digital In-Analogue Out Logic Gate Based on Metal-Oxide Memristor Devices. ISCAS 2019: 1-5
2018
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1810-03333
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1810-03333
Georgios Papandroulidakis, Alexantrou Serb, Ali Khiat, Geoff V. Merrett, Themistoklis Prodromakis:
Practical Implementation of Memristor-Based Threshold Logic Gates. CoRR abs/1810.03333 (2018)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.