I agree that this site is using cookies. You can find further informations here.
X
Holenstein, Thomas
62  results:
Search for persons X
?
1

Design and Characterization of a Bearingless Cross-Flow Fan:

, In: 2021 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM),
Bagaric, Ivana ; Steinert, Daniel ; Wassmer, Florian... - p. 1195-1200 , 2021
Link: https://doi.org/10.1109/..
 
?
2

Performance Benchmarking of a Novel Magnet-Free Bearingless..:

Holenstein, Thomas ; Schuck, Marcel ; Kolar, Johann W.
IEEE Open Journal of the Industrial Electronics Society.  1 (2020)  - p. 184-193 , 2020
Link: https://doi.org/10.1109/..
 
?
3

A Wide Air Gap Flux Switching Bearingless Motor With Odd an..:

Holenstein, Thomas ; Schuck, Marcel ; Kolar, Johann W.
IEEE Open Journal of Industry Applications.  1 (2020)  - p. 52-62 , 2020
Link: https://doi.org/10.1109/..
 
?
4

The Communication Complexity of Private Simultaneous Messag..:

Applebaum, Benny ; Holenstein, Thomas ; Mishra, Manoj.
Journal of Cryptology.  33 (2019)  3 - p. 917-953 , 2019
Link: https://doi.org/10.1007/..
 
?
5

Scaling and design of miniature high-speed bearingless slic..:

Schuck, Marcel ; Puentener, Pascal ; Holenstein, Thomas.
e & i Elektrotechnik und Informationstechnik.  136 (2019)  2 - p. 112-119 , 2019
Link: https://doi.org/10.1007/..
 
?
6

Optimal Circuits for Streamed Linear Permutations Using RAM:

, In: Proceedings of the 2016 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays,
Serre, François ; Holenstein, Thomas ; Püschel, Markus - p. 215-223 , 2016
Link: https://dl.acm.org/doi/1..
 
?
7

How to Build an Ideal Cipher: The Indifferentiability of th..:

Coron, Jean-Sébastien ; Holenstein, Thomas ; Künzler, Robin...
Journal of Cryptology.  29 (2014)  1 - p. 61-114 , 2014
Link: https://doi.org/10.1007/..
 
?
8

Subsampling mathematical relaxations and average-case compl..:

, In: Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms,
Barak, Boaz ; Hardt, Moritz ; Holenstein, Thomas. - p. 512-531 , 2011
Link: https://dl.acm.org/doi/1..
 
?
9

The equivalence of the random oracle model and the ideal ci..:

, In: Proceedings of the forty-third annual ACM symposium on Theory of computing,
Holenstein, Thomas ; Künzler, Robin ; Tessaro, Stefano - p. 89-98 , 2011
Link: https://dl.acm.org/doi/1..
 
?
10

Trace reconstruction with constant deletion probability and..:

, In: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms,
Holenstein, Thomas ; Mitzenmacher, Michael ; Panigrahy, Rina. - p. 389-398 , 2008
Link: https://dl.acm.org/doi/1..
 
?
11

Posted prices vs. negotiations : an asymptotic analysis:

, In: Proceedings of the 9th ACM conference on Electronic commerce,
Blumrosen, Liad ; Holenstein, Thomas - p. 49 ff. , 2008
Link: https://dl.acm.org/doi/1..
 
?
12

Parallel repetition : simplifications and the no-signali..:

, In: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing,
Holenstein, Thomas - p. 411-419 , 2007
Link: https://dl.acm.org/doi/1..
 
?
13

Key agreement from weak bit agreement:

, In: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing,
Holenstein, Thomas - p. 664-673 , 2005
Link: https://dl.acm.org/doi/1..
 
?
14

Accelerated force computation for physics-based information..:

, In: Proceedings of the symposium on Data visualisation 2003,
Hao, Ming C. ; Dayal, Umeshwar ; Cotting, Daniel.. - p. 59-66 , 2003
Link: https://dl.acm.org/doi/1..
 
?
15

Detectable byzantine agreement secure against faulty majori..:

, In: Proceedings of the twenty-first annual symposium on Principles of distributed computing,
Fitzi, Matthias ; Gottesman, Daniel ; Hirt, Martin.. - p. 118-126 , 2002
Link: https://dl.acm.org/doi/1..
 
1-15