Folgen
Oliver Keszöcze
Oliver Keszöcze
Friedrich-Alexander-Univeristät Erlangen-Nürnberg (FAU)
Bestätigte E-Mail-Adresse bei fau.de - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Look-Ahead Schemes for Nearest Neighbor Optimization of 1D and 2D Quantum Circuits
R Wille, O Keszocze, M Walter, P Rohrs, A Chattopadhyay, R Drechsler
Asia and South Pacific Design Automation Conference, 2016
1352016
Exact One-pass Synthesis of Digital Microfluidic Biochips
O Keszocze, R Wille, TY Ho, R Drechsler
Proceedings of the The 51st Annual Design Automation Conference on Design …, 2014
732014
Exact Routing for Micro-Electrode-Dot-Array Digital Microfluidic Biochips
O Keszocze, Z Li, A Grimmer, R Wille, K Charkabarty, R Drechsler
Asia and South Pacific Design Automation Conference, 2017
672017
Embedding of large Boolean functions for reversible logic
M Soeken, R Wille, O Keszocze, DM Miller, R Drechsler
ACM Journal on Emerging Technologies in Computing Systems (JETC) 12 (4), 1-26, 2015
662015
Determining the minimal number of lines for large reversible circuits
R Wille, O Keszocze, R Drechsler
Design, Automation & Test in Europe Conference & Exhibition (DATE), 2011, 1-4, 2011
642011
Exact Routing for Digital Microfluidic Biochips with Temporary Blockages
O Keszocze, R Wille, R Drechsler
Computer-Aided Design (ICCAD), 2014 IEEE/ACM International Conference on …, 2014
552014
A general and exact routing methodology for digital microfluidic biochips
O Keszocze, R Wille, K Chakrabarty, R Drechsler
2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD), 874-881, 2015
512015
Reverse BDD-based synthesis for splitter-free optical circuits
R Wille, O Keszocze, C Hopfmuller, R Drechsler
The 20th Asia and South Pacific Design Automation Conference, 172-177, 2015
402015
Synthesis of Approximate Coders for On-Chip Interconnects Using Reversible Logic
R Wille, O Keszocze, S Hillmich, M Walter, A Garcia-Ortiz
Design, Automation and Test in Europe, 2016
372016
Scalable one-pass synthesis for digital microfluidic biochips
R Wille, O Keszocze, R Drechsler, T Boehnisch, A Kroker
IEEE Design & Test 32 (6), 41-50, 2015
352015
Lips: An ide for model driven engineering based on natural language processing
O Keszocze, M Soeken, E Kuksa, R Drechsler
2013 1st International Workshop on Natural Language Analysis in Software …, 2013
322013
Task-driven software summarization
D Binkley, D Lawrie, E Hill, J Burge, I Harris, R Hebig, O Keszocze, ...
2013 IEEE International Conference on Software Maintenance, 432-435, 2013
252013
Efficient hardware acceleration of sparsely active convolutional spiking neural networks
J Sommer, MA Özkan, O Keszocze, J Teich
IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2022
212022
Chatbot-Based Assertion Generation from Natural Language Specifications
O Keszocze, IG Harris
Forum on Specification & Design Languages, 2019
202019
Dsp-packing: Squeezing low-precision arithmetic into fpga dsp blocks
J Sommer, MA Özkan, O Keszocze, J Teich
2022 32nd International Conference on Field-Programmable Logic and …, 2022
182022
Using deep learning to demodulate transmissions in molecular communication
M Bartunik, O Keszocze, B Schiller, J Kirchner
2022 IEEE 16th International Symposium on Medical Information and …, 2022
162022
Run-Time Enforcement of Non-Functional Application Requirements in Heterogeneous Many-Core Systems
J Teich, B Pourmohseni, O Keszocze, J Spieck, S Wildermann
Asia and South Pacific Design Automation Conference, 2020
152020
Gates vs. splitters: Contradictory optimization objectives in the synthesis of optical circuits
A Deb, R Wille, O Keszöcze, S Hillmich, R Drechsler
ACM Journal on Emerging Technologies in Computing Systems (JETC) 13 (1), 1-13, 2016
132016
Probabilistic Error Propagation through Approximated Boolean Networks
J Echavarria, S Wilderman, O Keszocze, J Teich
Design Automation Conference, 2020
122020
A Fast BDD Minimization Framework for Approximate Computing
A Wendler, O Keszocze
Design, Automation and Test in Europe, 2020
122020
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20