Search results for "JOP"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
115	Martin Schoeberl	JOP: A Java Optimized Processor.	OTM Workshops	2003	DBLP DOI BibTeX RDF
62	Martin Schoeberl	Java Technology in an FPGA.	FPL	2004	DBLP DOI BibTeX RDF
41	Christof Pitter, Martin Schoeberl	Towards a Java multiprocessor.	JTRES	2007	DBLP DOI BibTeX RDF	Java, multiprocessor, shared memory
41	Martin Schoeberl, Jan Vitek	Garbage collection for safety critical Java.	JTRES	2007	DBLP DOI BibTeX RDF	real-time system, garbage collection
41	Martin Schoeberl	A time predictable Java processor.	DATE	2006	DBLP DOI BibTeX RDF
37	Pang-Chieh Wang, Chin-Yang Lin, Cheng-Liang Lin, Yi-Fang Li, Cheng-Kai Yang, Ting-Wei Hou	A Portable Feather-Weight Java-Based Graphic Library for Embedded Systems on Java Processor.	IIH-MSP	2009	DBLP DOI BibTeX RDF	AWT, JOP, Java, Java processor
32	Loïc Buckwell, Olivier Gilles, Daniel Gracia Pérez, Nikolai Kosmatov	Execution at RISC: Stealth JOP Attacks on RISC-V Applications.	CoRR	2023	DBLP DOI BibTeX RDF
32	Loïc Buckwell, Olivier Gilles, Daniel Gracia Pérez, Nikolai Kosmatov	Execution at RISC: Stealth JOP Attacks on RISC-V Applications.	ESORICS Workshops (2)	2023	DBLP DOI BibTeX RDF
32	Rodothea-Myrsini Tsoupidi, Roberto Castañeda Lozano, Benoit Baudry	Constraint-based Diversification of JOP Gadgets.	J. Artif. Intell. Res.	2021	DBLP DOI BibTeX RDF
32	Alexey R. Nurmukhametov, Alexey V. Vishnyakov, Vlada Logunova, Shamil F. Kurmangaleev	MAJORCA: Multi-Architecture JOP and ROP Chain Assembler.	CoRR	2021	DBLP BibTeX RDF
32	Rodothea-Myrsini Tsoupidi, Roberto Castañeda Lozano, Benoit Baudry	Constraint-based Diversification of JOP Gadgets.	CoRR	2021	DBLP BibTeX RDF
32	Bramwell Brizendine, Austin Babcock	A Novel Method for the Automatic Generation of JOP Chain Exploits.	NCS	2021	DBLP DOI BibTeX RDF
32	Hyunyoung Oh, Myonghoon Yang, Yeongpil Cho, Yunheung Paek	ActiMon: Unified JOP and ROP Detection With Active Function Lists on an SoC FPGA.	IEEE Access	2019	DBLP DOI BibTeX RDF
32	Yongje Lee, Jinyong Lee, Ingoo Heo, Dongil Hwang, Yunheung Paek	Integration of ROP/JOP monitoring IPs in an ARM-based SoC.	DATE	2016	DBLP BibTeX RDF
32	Fan Yao, Jie Chen 0020, Guru Venkataramani	JOP-alarm: Detecting jump-oriented programming-based anomalies in applications.	ICCD	2013	DBLP DOI BibTeX RDF
32	Muhammad Nadeem, Morteza Biglari-Abhari, Zoran Salcic	JOP-plus - A processor for efficient execution of java programs extended with GALS concurrency.	ASP-DAC	2012	DBLP DOI BibTeX RDF
32	Muhammad Nadeem, Morteza Biglari-Abhari, Zoran Salcic	GALS-JOP: A Java Embedded Processor for GALS Reactive Programs.	DASC	2011	DBLP DOI BibTeX RDF
32	Gregor Fischer, Jürgen Wolff von Gudenberg	JOP ein Java Online Praktikum der vhb.	Softwaretechnik-Trends	2002	DBLP BibTeX RDF
32	Emma Hart, Peter Ross	A Systematic Investigation of GA Performance on Jop Shop Scheduling Problems.	EvoWorkshops	2000	DBLP DOI BibTeX RDF
27	Jop Briët, Matthias Christandl, Itai Leigh, Amir Shpilka, Jeroen Zuiddam	Discreteness of Asymptotic Tensor Ranks (Extended Abstract).	ITCS	2024	DBLP DOI BibTeX RDF
27	Jop Briët, Harry Buhrman, Davi Castro-Silva, Niels M. P. Neumann	Noisy Decoding by Shallow Circuits with Parities: Classical and Quantum (Extended Abstract).	ITCS	2024	DBLP DOI BibTeX RDF
27	Roel Lambers, Jop Briët, Viresh Patel, Frits C. R. Spieksma, Mehmet Akif Yildiz	Orthogonal schedules in single round robin tournaments.	Oper. Res. Lett.	2023	DBLP DOI BibTeX RDF
27	Jop Briët, Matthias Christandl, Itai Leigh, Amir Shpilka, Jeroen Zuiddam	Discreteness of asymptotic tensor ranks.	CoRR	2023	DBLP DOI BibTeX RDF
27	Jop Briët, Harry Buhrman, Davi Castro-Silva, Niels M. P. Neumann	Noisy decoding by shallow circuits with parities: classical and quantum.	CoRR	2023	DBLP DOI BibTeX RDF
27	Andries van Beek, Benjamin Malmberg, Peter Borm, Marieke Quant, Jop Schouten	Competition and cooperation in linear production and sequencing processes.	Games Econ. Behav.	2023	DBLP DOI BibTeX RDF
27	Roos Hutter, Jop Sutmuller, Mary Adib, David Rau, Jaap Kamps	University of Amsterdam at the CLEF 2023 SimpleText Track.	CLEF (Working Notes)	2023	DBLP BibTeX RDF
27	Jop Schouten, Bas J. Dietzenbacher, Peter Borm	The nucleolus and inheritance of properties in communication situations.	Ann. Oper. Res.	2022	DBLP DOI BibTeX RDF
27	Julia Burggraaf, Jop Groeneweg, Simone Sillem, Pieter van Gelder	What employees do today because of their experience yesterday: Previous exposure to yellow: number aspects as a cause for SPAD incidents.	J. Rail Transp. Plan. Manag.	2022	DBLP DOI BibTeX RDF
27	Jop Briët, Francisco Escudero Gutiérrez	On converses to the polynomial method.	CoRR	2022	DBLP DOI BibTeX RDF
27	Jop Briët, Francisco Escudero Gutiérrez, Sander Gribling	Grothendieck inequalities characterize converses to the polynomial method.	CoRR	2022	DBLP DOI BibTeX RDF
27	Jop Briët, Francisco Escudero Gutiérrez	On Converses to the Polynomial Method.	TQC	2022	DBLP DOI BibTeX RDF
27	Jop Vermeer, Leonardo Scandolo, Elmar Eisemann	Stochastic-Depth Ambient Occlusion.	Proc. ACM Comput. Graph. Interact. Tech.	2021	DBLP DOI BibTeX RDF
27	Jop Schouten, Alejandro Saavedra-Nieves, M. Gloria Fiestras-Janeiro	Sequencing situations and games with non-linear cost functions under optimal order consistency.	Eur. J. Oper. Res.	2021	DBLP DOI BibTeX RDF
27	Jop Briët, Farrokh Labib	High-Entropy Dual Functions and Locally Decodable Codes (Extended Abstract).	ITCS	2021	DBLP DOI BibTeX RDF
27	Jop Beugels, Job van den Hurk, Judith C. Peters, Esther M. Heuts, Stefania M. H. Tuinder, Rainer Goebel, René R. W. J. van der Hulst	Somatotopic mapping of the human breast using 7 T functional MRI.	NeuroImage	2020	DBLP DOI BibTeX RDF
27	Alejandro Saavedra-Nieves, Jop Schouten, Peter Borm	On interactive sequencing situations with exponential cost functions.	Eur. J. Oper. Res.	2020	DBLP DOI BibTeX RDF
27	Tom Bannink, Jop Briët, Farrokh Labib, Hans Maassen	Quasirandom quantum channels.	Quantum	2020	DBLP DOI BibTeX RDF
27	Tom Bannink, Jop Briët, Farrokh Labib, Hans Maassen	Quasirandom Quantum Channels.	TQC	2020	DBLP DOI BibTeX RDF
27	Jop Briët, Zeev Dvir, Sivakanth Gopi	Outlaw Distributions and Locally Decodable Codes.	Theory Comput.	2019	DBLP DOI BibTeX RDF
27	Shaad Alaka, Max Lopes Cunha, Jop Vermeer, Nestor Z. Salamon, J. Timothy Balint, Rafael Bidarra	Stimulating ideation in new teams with the mobile game Grapplenauts.	Int. J. Serious Games	2019	DBLP DOI BibTeX RDF
27	Srinivasan Arunachalam, Jop Briët, Carlos Palazuelos	Quantum Query Algorithms Are Completely Bounded Forms.	SIAM J. Comput.	2019	DBLP DOI BibTeX RDF
27	Tom Bannink, Jop Briët, Harry Buhrman, Farrokh Labib, Troy Lee	Bounding Quantum-Classical Separations for Classes of Nonlocal Games.	STACS	2019	DBLP DOI BibTeX RDF
27	Nico Arjen Miedema, Jop Vermeer, Stephan G. Lukosch, Rafael Bidarra	Superhuman sports in mixed reality: the multi-player game League of Lasers.	VR	2019	DBLP DOI BibTeX RDF
27	Jop Briët, Simon Perdrix	Quantum Computation and Information - Introduction to the Special Theme.	ERCIM News	2018	DBLP BibTeX RDF
27	Jop Briët, Harry Buhrman, Debbie W. Leung, Teresa Piovesan, Florian Speelman	Round elimination in exact communication complexity.	CoRR	2018	DBLP BibTeX RDF
27	Srinivasan Arunachalam, Jop Briët, Carlos Palazuelos	Quantum Query Algorithms are Completely Bounded Forms.	ITCS	2018	DBLP DOI BibTeX RDF
27	Jop Vermeer, Shaad Alaka, Niels de Bruin, Nico Arjen Miedema, Nick Winnubst, Cyril Trap, Rafael Bidarra	League of lasers: a superhuman sport using motion tracking.	Superhuman Sports Design Challenge	2018	DBLP DOI BibTeX RDF
27	Jop Briët, Oded Regev 0001, Rishi Saket	Tight Hardness of the Non-Commutative Grothendieck Problem.	Theory Comput.	2017	DBLP DOI BibTeX RDF
27	Jop Briët, Jeroen Zuiddam	Orthogonal rank and impossibility of quantum round elimination.	Quantum Inf. Comput.	2017	DBLP DOI BibTeX RDF
27	Srinivasan Arunachalam, Jop Briët, Carlos Palazuelos	Quantum Query Algorithms are Completely Bounded Forms.	CoRR	2017	DBLP BibTeX RDF
27	Jop Briët, Sivakanth Gopi	Gaussian width bounds with applications to arithmetic progressions in random settings.	CoRR	2017	DBLP BibTeX RDF
27	Jop Briët, Zeev Dvir, Sivakanth Gopi	Outlaw Distributions and Locally Decodable Codes.	ITCS	2017	DBLP DOI BibTeX RDF
27	Divesh Aggarwal, Jop Briët	Revisiting the Sanders-Freiman-Ruzsa Theorem in $\mathbb{F}_p^n$ and its Application to Non-malleable Codes.	CoRR	2016	DBLP BibTeX RDF
27	Jop Briët, Jeroen Zuiddam	On the orthogonal rank of Cayley graphs and impossibility of quantum round elimination.	CoRR	2016	DBLP BibTeX RDF
27	Jop Briët, Zeev Dvir, Sivakanth Gopi	Outlaw distributions and locally decodable codes.	CoRR	2016	DBLP BibTeX RDF
27	Jop Briët	On Embeddings of l1k from Locally Decodable Codes.	CoRR	2016	DBLP BibTeX RDF
27	Mahmut Reyhanoglu, Derek Hoffman, Jop de Wit	Nonlinear modeling and control of a two-link hybrid manipulator.	ICARCV	2016	DBLP DOI BibTeX RDF
27	Divesh Aggarwal, Jop Briët	Revisiting the Sanders-Bogolyubov-Ruzsa theorem in Fpn and its application to non-malleable codes.	ISIT	2016	DBLP DOI BibTeX RDF
27	Jop Briët	On Embeddings of ℓ1k from Locally Decodable Codes.	Electron. Colloquium Comput. Complex.	2015	DBLP BibTeX RDF
27	Jop Briët, Harry Buhrman, Monique Laurent, Teresa Piovesan, Giannicola Scarpa	Entanglement-Assisted Zero-Error Source-Channel Coding.	IEEE Trans. Inf. Theory	2015	DBLP DOI BibTeX RDF
27	Jop Briët, Daniel Dadush, Sebastian Pokutta	On the existence of 0/1 polytopes with high semidefinite extension complexity.	Math. Program.	2015	DBLP DOI BibTeX RDF
27	Jop Briët, Harry Buhrman, Debbie W. Leung, Teresa Piovesan, Florian Speelman	Round Elimination in Exact Communication Complexity.	TQC	2015	DBLP DOI BibTeX RDF
27	Jop Briët, Oded Regev 0001, Rishi Saket	Tight Hardness of the Non-commutative Grothendieck Problem.	FOCS	2015	DBLP DOI BibTeX RDF
27	Jop van den Hoogen, Sebastiaan A. Meijer	Lessons on the design of gaming simulations for convergence and divergence in volatile innovation environments.	WSC	2015	DBLP DOI BibTeX RDF
27	Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin	Grothendieck Inequalities for Semidefinite Programs with Rank Constraint.	Theory Comput.	2014	DBLP DOI BibTeX RDF
27	Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf	Lower Bounds for Approximate LDCs.	Electron. Colloquium Comput. Complex.	2014	DBLP BibTeX RDF
27	Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf	Lower Bounds for Approximate LDC.	CoRR	2014	DBLP BibTeX RDF
27	Jop Briët, Oded Regev 0001	Tight Hardness of the Non-commutative Grothendieck Problem.	CoRR	2014	DBLP BibTeX RDF
27	Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf	Lower Bounds for Approximate LDCs.	ICALP (1)	2014	DBLP DOI BibTeX RDF
27	Jop van den Hoogen, Julia C. Lo, Sebastiaan A. Meijer	Debriefing in gaming simulation for research: opening the black box of the non-trivial machine to assess validity and reliability.	WSC	2014	DBLP DOI BibTeX RDF
27	Jop Briët, Harry Buhrman, Troy Lee, Thomas Vidick	Multipartite entanglement in XOR games.	Quantum Inf. Comput.	2013	DBLP DOI BibTeX RDF
27	Jop Briët, Daniel Dadush, Sebastian Pokutta	On the existence of 0/1 polytopes with high semidefinite extension complexity	CoRR	2013	DBLP BibTeX RDF
27	Martin Schmettow, Jop Havinga	Are users more diverse than designs?: testing and extending a 25 years old claim.	BCS HCI	2013	DBLP BibTeX RDF
27	Hans Henseler, Jop Hofste, Maurice van Keulen	Digital-Forensics Based Pattern Recognition for Discovering Identities in Electronic Evidence.	EISIC	2013	DBLP DOI BibTeX RDF
27	Jop Briët, Daniel Dadush, Sebastian Pokutta	On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity.	ESA	2013	DBLP DOI BibTeX RDF
27	Jop Hofste, Hans Henseler, Maurice van Keulen	Computer assisted extraction, merging and correlation of identities with tracks inspector.	ICAIL	2013	DBLP DOI BibTeX RDF
27	Julia C. Lo, Jop van den Hoogen, Sebastiaan A. Meijer	Using gaming simulation experiments to test railway innovations: Implications for validity.	WSC	2013	DBLP DOI BibTeX RDF
27	Jop van den Hoogen, Sebastiaan A. Meijer	Games for Searching Technology Landscapes.	ISAGA	2013	DBLP DOI BibTeX RDF
27	Jop Briët, Sourav Chakraborty 0001, David García-Soriano, Arie Matsliah	Monotonicity testing and shortest-path routing on the cube.	Comb.	2012	DBLP DOI BibTeX RDF
27	Jop Briët, Assaf Naor, Oded Regev 0001	Locally decodable codes and the failure of cotype for projective tensor products	CoRR	2012	DBLP BibTeX RDF
27	Jop Briët, Harry Buhrman, Dion Gijswijt	Violating the Shannon capacity of metric graphs with entanglement	CoRR	2012	DBLP BibTeX RDF
27	Nick van de Giesen, Susan C. Steele-Dunne, Jop Jansen, Olivier Hoes, Mark B. Hausner, Scott W. Tyler, John S. Selker	Double-Ended Calibration of Fiber-Optic Raman Spectra Distributed Temperature Sensing Data.	Sensors	2012	DBLP DOI BibTeX RDF
27	David García-Soriano, Arie Matsliah, Sourav Chakraborty 0001, Jop Briët	Monotonicity Testing and Shortest-Path Routing on the Cube.	Electron. Colloquium Comput. Complex.	2010	DBLP BibTeX RDF
27	Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin	Grothendieck inequalities for semidefinite programs with rank constraint	CoRR	2010	DBLP BibTeX RDF
27	Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin	The Positive Semidefinite Grothendieck Problem with Rank Constraint.	ICALP (1)	2010	DBLP DOI BibTeX RDF
27	Jop Briët, Sourav Chakraborty 0001, David García-Soriano, Arie Matsliah	Monotonicity Testing and Shortest-Path Routing on the Cube.	APPROX-RANDOM	2010	DBLP DOI BibTeX RDF
27	Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin	The positive semidefinite Grothendieck problem with rank constraint.	CoRR	2009	DBLP BibTeX RDF
27	Jop Briët, Ronald de Wolf	Locally Decodable Quantum Codes.	STACS	2009	DBLP DOI BibTeX RDF
27	Sander Limonard, Jop Esmeijer, Martijn Staal	Business considerations in creating a social TV experience.	EuroITV	2009	DBLP DOI BibTeX RDF
27	Flaminia L. Luccio, Jop F. Sibeyn	Feedback vertex sets in mesh-based networks.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
27	Debora Donato, Luigi Laura, Stefano Leonardi 0001, Ulrich Meyer 0001, Stefano Millozzi, Jop F. Sibeyn	Algorithms and Experiments for the Webgraph.	J. Graph Algorithms Appl.	2006	DBLP DOI BibTeX RDF
27	Jop F. Sibeyn	External selection.	J. Algorithms	2006	DBLP DOI BibTeX RDF
27	Jop F. Sibeyn	Faster gossiping on butterfly networks.	Theor. Comput. Sci.	2005	DBLP DOI BibTeX RDF
27	David Peleg, Jop F. Sibeyn	Preface: Structural Information and Communication Complexity.	Theor. Comput. Sci.	2005	DBLP DOI BibTeX RDF
27	Jop F. Sibeyn	External matrix multiplication and all-pairs shortest path.	Inf. Process. Lett.	2004	DBLP DOI BibTeX RDF
27	Jop F. Sibeyn	External Connected Components.	SWAT	2004	DBLP DOI BibTeX RDF	External Algorithms, Tree Rooting, Connected Components, List Ranking, Graph Problems
27	Roman Dementiev, Peter Sanders 0001, Dominik Schultes, Jop F. Sibeyn	Engineering an External Memory Minimum Spanning Tree Algorithm.	IFIP TCS	2004	DBLP DOI BibTeX RDF
27	Flaminia L. Luccio, Jop F. Sibeyn	Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks.	SIROCCO	2004	DBLP DOI BibTeX RDF
27	Peter Sanders 0001, Jop F. Sibeyn	A bandwidth latency tradeoff for broadcast and reduction.	Inf. Process. Lett.	2003	DBLP DOI BibTeX RDF
27	Jop F. Sibeyn, Michal Soch	Optimal Gossiping on CCCs of Even Dimension.	Parallel Process. Lett.	2003	DBLP DOI BibTeX RDF