default search action
Erik van der Sluis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [i3]Haji Akhundov, Erik van der Sluis, Said Hamdioui, Mottaqiallah Taouil:
Public-Key Based Authentication Architecture for IoT Devices Using PUF. CoRR abs/2002.01277 (2020)
2010 – 2019
- 2017
- [c9]Bin Chen, Tanya Ignatenko, Frans M. J. Willems, Roel Maes, Erik van der Sluis, Georgios N. Selimis:
A Robust SRAM-PUF Key Generation Scheme Based on Polar Codes. GLOBECOM 2017: 1-6 - [c8]Lieneke Kusters, Tanya Ignatenko, Frans M. J. Willems, Roel Maes, Erik van der Sluis, Georgios N. Selimis:
Security of helper data schemes for SRAM-PUF in multiple enrollment scenarios. ISIT 2017: 1803-1807 - [i2]Bin Chen, Tanya Ignatenko, Frans M. J. Willems, Roel Maes, Erik van der Sluis, Georgios N. Selimis:
High-Rate Error Correction Schemes for SRAM-PUFs based on Polar Codes. CoRR abs/1701.07320 (2017) - 2016
- [j8]Roel Maes, Vincent van der Leest, Erik van der Sluis, Frans M. J. Willems:
Secure key generation from biased PUFs: extended version. J. Cryptogr. Eng. 6(2): 121-137 (2016) - 2015
- [c7]Roel Maes, Vincent van der Leest, Erik van der Sluis, Frans M. J. Willems:
Secure Key Generation from Biased PUFs. CHES 2015: 517-534 - [i1]Roel Maes, Vincent van der Leest, Erik van der Sluis, Frans M. J. Willems:
Secure Key Generation from Biased PUFs. IACR Cryptol. ePrint Arch. 2015: 583 (2015) - 2012
- [c6]Vincent van der Leest, Erik van der Sluis, Geert Jan Schrijen, Pim Tuyls, Helena Handschuh:
Efficient Implementation of True Random Number Generator Based on SRAM PUFs. Cryptography and Security 2012: 300-318 - [c5]Vincent van der Leest, Bart Preneel, Erik van der Sluis:
Soft Decision Error Correction for Compact Memory-Based PUFs Using a Single Enrollment. CHES 2012: 268-282 - [c4]Roel Maes, Vladimir Rozic, Ingrid Verbauwhede, Patrick Koeberl, Erik van der Sluis, Vincent van der Leest:
Experimental evaluation of Physically Unclonable Functions in 65 nm CMOS. ESSCIRC 2012: 486-489 - [c3]Peter Simons, Erik van der Sluis, Vincent van der Leest:
Buskeeper PUFs, a promising alternative to D Flip-Flop PUFs. HOST 2012: 7-12 - 2010
- [j7]Paul E. Joustra, Erik van der Sluis, Nico M. van Dijk:
To pool or not to pool in hospitals: a theoretical and practical comparison for a radiotherapy outpatient department. Ann. Oper. Res. 178(1): 77-89 (2010)
2000 – 2009
- 2009
- [j6]Nico M. van Dijk, Erik van der Sluis:
Pooling is not the answer. Eur. J. Oper. Res. 197(1): 415-421 (2009) - [j5]Nico M. van Dijk, Erik van der Sluis:
Call packing bound for overflow loss systems. Perform. Evaluation 66(1): 1-20 (2009) - 2008
- [j4]Nico M. van Dijk, Erik van der Sluis:
Bounds for simulation. J. Simulation 2(1): 61-65 (2008) - [j3]Nico M. van Dijk, Erik van der Sluis:
Practical optimization by OR and simulation. Simul. Model. Pract. Theory 16(8): 1113-1122 (2008) - 2006
- [j2]Nico M. van Dijk, Erik van der Sluis:
Check-in computation and optimization by simulation and IP in combination. Eur. J. Oper. Res. 171(3): 1152-1168 (2006) - [c2]Nico M. van Dijk, Erik van der Sluis:
OR for Simulation and Its Optimization. OR 2006: 587-592 - 2005
- [c1]Nico M. van Dijk, Erik van der Sluis, René Haijema, Assil Al-Ibrahim, Jan van der Wal:
Simulation and or (operations research) in combination for practical optimization. WSC 2005: 274-284 - 2002
- [j1]Nico M. van Dijk, Erik van der Sluis:
Simple Product-Form Bounds for Queueing Networks with Finite Clusters. Ann. Oper. Res. 113(1-4): 175-195 (2002)
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint