default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheodore Andronikos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Theodore Andronikos
, Alla Sirokofskich:
A Multiparty Quantum Private Equality Comparison Scheme Relying on |GHZ3⟩ States. Future Internet 16(9): 309 (2024)- [j24]Theodore Andronikos, Alla Sirokofskich:
A Quantum Approach to News Verification from the Perspective of a News Aggregator. Inf. 15(4): 207 (2024) - 2023
- [j23]Michael Ampatzis, Theodore Andronikos:
Quantum Secret Aggregation Utilizing a Network of Agents. Cryptogr. 7(1): 5 (2023) - [j22]Theodore Andronikos, Alla Sirokofskich:
One-to-Many Simultaneous Secure Quantum Information Transmission. Cryptogr. 7(4): 64 (2023) - [j21]Kalliopi Kastampolidou, Theodore Andronikos:
Quantum Tapsilou - A Quantum Game Inspired by the Traditional Greek Coin Tossing Game Tapsilou. Games 14(6): 72 (2023) - 2022
- [j20]Theodore Andronikos, Michail Stefanidakis:
A Two-Party Quantum Parliament. Algorithms 15(2): 62 (2022) - [j19]Kalliopi Kastampolidou, Christos Papalitsas, Theodore Andronikos:
The Distributed Kolkata Paise Restaurant Game. Games 13(3): 33 (2022) - [j18]Theodore Andronikos:
Conditions that enable a player to surely win in sequential quantum games. Quantum Inf. Process. 21(7): 268 (2022) - [j17]Michael Ampatzis, Theodore Andronikos:
A Symmetric Extensible Protocol for Quantum Secret Sharing. Symmetry 14(8): 1692 (2022) - [i7]Michael Ampatzis, Theodore Andronikos:
A symmetric extensible protocol for quantum secret sharing. CoRR abs/2204.13397 (2022) - [i6]Dimitris Kostadimas, Kalliopi Kastampolidou, Theodore Andronikos:
Viewing biological and computer viruses as manifestations of games. CoRR abs/2212.03966 (2022) - 2021
- [j16]Michael Ampatzis, Theodore Andronikos:
QKD Based on Symmetric Entangled Bernstein-Vazirani. Entropy 23(7): 870 (2021) - [c25]Dimitris Kostadimas, Kalliopi Kastampolidou, Theodore Andronikos:
Correlation of biological and computer viruses through evolutionary game theory. SMAP 2021: 1-6 - [i5]Theodore Andronikos, Alla Sirokofskich:
The connection between the PQ penny flip game and the dihedral groups. CoRR abs/2104.12043 (2021) - [i4]Michael Ampatzis, Theodore Andronikos:
QKD based on symmetric entangled Bernstein-Vazirani. CoRR abs/2106.03815 (2021) - [i3]Dimitris Kostadimas, Kalliopi Kastampolidou, Theodore Andronikos:
Correlation of biological and computer viruses through evolutionary game theory. CoRR abs/2108.00508 (2021)
2010 – 2019
- 2019
- [j15]Christos Papalitsas, Theodore Andronikos, Konstantinos Giannakis, Georgia Theocharopoulou, Sofia Fanarioti:
A QUBO Model for the Traveling Salesman Problem with Time Windows. Algorithms 12(11): 224 (2019) - [c24]Konstantinos Giannakis, Christos Papalitsas, Georgia Theocharopoulou, Sofia Fanarioti, Theodore Andronikos:
A Quantum-inspired optimization Heuristic for the Multiple Sequence Alignment Problem in Bio-computing. IISA 2019: 1-8 - [c23]Georgia Theocharopoulou, Konstantinos Giannakis, Christos Papalitsas, Sofia Fanarioti, Theodore Andronikos:
Elements of Game Theory in a Bio-inspired Model of Computation. IISA 2019: 1-4 - 2018
- [j14]Christos Papalitsas, Panayiotis Karakostas, Theodore Andronikos, Spyros Sioutas, Konstantinos Giannakis:
Combinatorial GVNS (General Variable Neighborhood Search) Optimization for Dynamic Garbage Collection. Algorithms 11(4): 38 (2018) - [c22]Christos Papalitsas, Theodore Andronikos, Panagiotis Karakostas:
Studying the Impact of Perturbation Methods on the Efficiency of GVNS for the ATSP. ICVNS 2018: 287-302 - 2017
- [j13]Konstantinos Giannakis, Theodore Andronikos:
Membrane automata for modeling biomolecular processes. Nat. Comput. 16(1): 151-163 (2017) - [c21]Theodore Andronikos, Alexander Singh, Konstantinos Giannakis, Spyros Sioutas:
Computing Probabilistic Queries in the Presence of Uncertainty via Probabilistic Automata. ALGOCLOUD 2017: 106-120 - [i2]Alexander Singh, Konstantinos Giannakis, Theodore Andronikos:
Qumin, a minimalist quantum programming language. CoRR abs/1704.04460 (2017) - 2016
- [j12]Konstantinos Giannakis, Georgia Theocharopoulou, Christos Papalitsas, Theodore Andronikos, Panayiotis M. Vlamos:
Associating ω-automata to path queries on Webs of Linked Data. Eng. Appl. Artif. Intell. 51: 115-123 (2016) - 2015
- [j11]Konstantinos Giannakis, Christos Papalitsas, Kalliopi Kastampolidou, Alexandros Singh, Theodore Andronikos:
Dominant Strategies of Quantum Games on Quantum Periodic Automata. Comput. 3(4): 586-599 (2015) - [c20]Konstantinos Giannakis, Christos Papalitsas, Theodore Andronikos:
Quantum automata for infinite periodic words. IISA 2015: 1-6 - [c19]Christos Papalitsas, Konstantinos Giannakis, Theodore Andronikos, Dimitrios Theotokis, Angelo Sifaleras:
Initialization methods for the TSP with Time Windows using Variable Neighborhood Search. IISA 2015: 1-6 - [c18]Georgia Theocharopoulou, Konstantinos Giannakis, Theodore Andronikos:
The mechanism of splitting mitochondria in terms of membrane automata. ISSPIT 2015: 397-402 - 2014
- [c17]Konstantinos Giannakis, Theodore Andronikos:
Querying Linked Data and Büchi Automata. SMAP 2014: 110-114 - 2012
- [j10]Ioannis Riakiotakis, Florina M. Ciorba, Theodore Andronikos, George K. Papakonstantinou, Anthony T. Chronopoulos:
Towards the optimal synchronization granularity for dynamic scheduling of pipelined computations on heterogeneous computing systems. Concurr. Comput. Pract. Exp. 24(18): 2302-2327 (2012) - 2011
- [j9]Ioannis Riakiotakis, Florina M. Ciorba, Theodore Andronikos, George K. Papakonstantinou:
Distributed dynamic load balancing for pipelined computations on heterogeneous systems. Parallel Comput. 37(10-11): 713-729 (2011) - 2010
- [j8]Theodore Andronikos, Florina M. Ciorba, Ioannis Riakiotakis, George K. Papakonstantinou, Anthony T. Chronopoulos:
Studying the impact of synchronization frequency on scheduling tasks with dependencies in heterogeneous systems. Perform. Evaluation 67(12): 1324-1339 (2010)
2000 – 2009
- 2009
- [j7]Christos Pavlatos, Alexandros C. Dimopoulos, Andrew Koulouris, Theodore Andronikos, Ioannis Panagopoulos, George K. Papakonstantinou:
Efficient reconfigurable embedded parsers. Comput. Lang. Syst. Struct. 35(2): 196-215 (2009) - [c16]Theodore Andronikos, Michalis Stefanidakis, Ioannis Papadakis:
Adding Temporal Dimension to Ontologies via OWL Reification. Panhellenic Conference on Informatics 2009: 19-22 - 2008
- [j6]Florina M. Ciorba, Ioannis Riakiotakis, Theodore Andronikos, George K. Papakonstantinou, Anthony T. Chronopoulos:
Enhancing self-scheduling algorithms via synchronization and weighting. J. Parallel Distributed Comput. 68(2): 246-264 (2008) - [j5]Theodore Andronikos, Florina M. Ciorba, Panayiotis Theodoropoulos, Dimitris Kamenopoulos, George K. Papakonstantinou:
Cronus: A platform for parallel code generation based on computational geometry methods. J. Syst. Softw. 81(8): 1389-1405 (2008) - 2007
- [c15]Florina M. Ciorba, Ioannis Riakiotakis, George K. Papakonstantinou, Theodore Andronikos, Anthony T. Chronopoulos:
Studying the impact of synchronization frequency on scheduling tasks with dependencies in heterogeneous systems. PACT 2007: 403 - [c14]Florina M. Ciorba, Ioannis Riakiotakis, Theodore Andronikos, Anthony T. Chronopoulos, George K. Papakonstantinou:
Optimal synchronization frequency for dynamic pipelined computations on heterogeneous systems. CLUSTER 2007: 410-415 - 2006
- [c13]Ioannis Riakiotakis, Florina M. Ciorba, Theodore Andronikos, George K. Papakonstantinou:
Self-Adapting Scheduling for Tasks with Dependencies in Stochastic Environments. CLUSTER 2006 - [c12]Florina M. Ciorba, Theodore Andronikos, Ioannis Riakiotakis, Anthony T. Chronopoulos, George K. Papakonstantinou:
Dynamic multi phase scheduling for heterogeneous clusters. IPDPS 2006 - 2005
- [c11]Florina M. Ciorba, Theodore Andronikos, Ioannis Drositis, George K. Papakonstantinou, Panayotis Tsanakas:
Reducing the Communication Cost via Chain Pattern Scheduling. NCA 2005: 186-196 - [i1]Foto N. Afrati, Theodore Andronikos, Vassia Pavlaki, Eugénie Foustoucos, Irène Guessarian:
On relating CTL to Datalog. CoRR abs/cs/0510012 (2005) - 2003
- [j4]Irène Guessarian, Eugénie Foustoucos, Theodore Andronikos, Foto N. Afrati:
On temporal logic versus datalog. Theor. Comput. Sci. 303(1): 103-133 (2003) - [c10]Theodore Andronikos, Marios Kalathas, Florina M. Ciorba, Panayiotis Theodoropoulos, George K. Papakonstantinou, Panayotis Tsanakas:
Scheduling Nested Loops with the Least Number of Processors. Applied Informatics 2003: 713-718 - [c9]Foto N. Afrati, Theodore Andronikos, Vassia Pavlaki, E. Foustoukos, Irène Guessarian:
From CTL to Datalog. PCK50 2003: 72-85 - 2002
- [c8]Ioannis Drositis, Theodore Andronikos, George Manis, George K. Papakonstantinou, Nectarios Koziris:
Geometric Scheduling of 2-D UET-UCT Uniform Dependence Loops. PDP 2002: 343- - 2001
- [j3]George K. Papakonstantinou, Theodore Andronikos, Ioannis Drositis:
On parallelization of UET / UET-UCT loops. Neural Parallel Sci. Comput. 9(3-4): 279-318 (2001) - [c7]Ioannis Drositis, Theodore Andronikos, Aggelos Kokorogiannis, George K. Papakonstantinou, Nectarios Koziris:
Geometric Scheduling of 2-D Uniform Dependence Loops. ICPADS 2001: 259-264 - 2000
- [c6]Theodore Andronikos, Nectarios Koziris:
Optimal scheduling for UET-UCT grids into fixed number of processors. PDP 2000: 237-243
1990 – 1999
- 1999
- [j2]Theodore Andronikos, Nectarios Koziris, George K. Papakonstantinou, Panayotis Tsanakas:
Optimal Scheduling for UET/UET-UCT Generalized n-Dimensional Grid Task Graphs. J. Parallel Distributed Comput. 57(2): 140-165 (1999) - 1998
- [c5]Andrew Koulouris, Nectarios Koziris, Theodore Andronikos, George K. Papakonstantinou, Panayiotis Tsanakas:
Automatic generation of a VLSI parallel architecture for QRS detection. EUSIPCO 1998: 1-4 - [c4]Andrew Koulouris, Nectarios Koziris, Theodore Andronikos, George K. Papakonstantinou, Panayotis Tsanakas:
A Parallel Parsing VLSI Architecture for Arbitrary Context Free Grammars. ICPADS 1998: 783- - 1997
- [j1]Theodore Andronikos, Nectarios Koziris, Zacharias Tsiatsoulis, George K. Papakonstantinou, Panayotis Tsanakas:
Lower Time and Processor Bounds for Efficient Mapping of Uniform Dependence Algorithms into Systolic Arrays. Parallel Algorithms Appl. 10(3-4): 177-194 (1997) - [c3]Foto N. Afrati, Theodore Andronikos, Theodore G. Kavalieros:
On the Expressiveness of Query Languages with Linear Constraints; Capturing Desirable Spatial Properties. CDB 1997: 105-115 - [c2]Nectarios Koziris, Theodore Andronikos, George Economakos, George K. Papakonstantinou, Panayotis Tsanakas:
Automatic Hardware Synthesis of Nested Loops Using UET Grids and VHDL. HPCN Europe 1997: 888-897 - [c1]Theodore Andronikos, Nectarios Koziris, George K. Papakonstantinou, Panayotis Tsanakas:
Optimal Scheduling for UET-UCT Generalized n-Dimensional Grid Task Graphs. IPPS 1997: 146-151
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-23 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
