Christos Nomikos

According to our database1, Christos Nomikos authored at least 24 papers between 2001 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 




Stathis Zachos at 70!
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

On the 'in many cases' Modality: Tableaux, Decidability, Complexity, Variants.
Proceedings of the Artificial Intelligence: Methods and Applications, 2014

A Map-Reduce algorithm for querying linked data based on query decomposition into stars.
Proceedings of the Workshops of the EDBT/ICDT 2014 Joint Conference (EDBT/ICDT 2014), 2014

Game Semantics for Non-monotonic Intensional Logic Programming.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2013

An Algorithm for Querying Linked Data Using Map-Reduce.
Proceedings of the Data Management in Cloud, Grid and P2P Systems, 2013

Notions of Bisimulation for Heyting-Valued Modal Languages.
J. Log. Comput., 2012

Strong equivalence of logic programs under the infinite-valued semantics.
Inf. Process. Lett., 2009

A Game-Theoretic Characterization of Boolean Grammars.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

On a Simple 3-valued Modal Language and a 3-valued Logic of 'not-fully-justified' Belief.
Logic Journal of the IGPL, 2008

On the Semantic Approaches to Boolean Grammars.
Proceedings of the Topological and Game-Theoretic Aspects of Infinite Computations, 29.06., 2008

Randomized and Approximation Algorithms for Blue-Red Matching.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Locally Stratified Boolean Grammars.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost.
Computer Networks, 2006

Well-Founded Semantics for Boolean Grammars.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

Temporal stratification tests for linear and branching-time deductive databases.
Theor. Comput. Sci., 2005

Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree.
Proceedings of the Advances in Informatics, 2005

A Sufficient Condition for Strong Equivalence Under the Well-Founded Semantics.
Proceedings of the Logic Programming, 21st International Conference, 2005

A limit characterization for the number of spanning trees of graphs.
Inf. Process. Lett., 2004

A Proof Procedure For Temporal Logic Programming.
Int. J. Found. Comput. Sci., 2004

Fiber Cost Reduction and Wavelength Minimization in Multifiber WDM Networks.
Proceedings of the NETWORKING 2004, 2004

Satisfying a maximum number of pre-routed requests in all-optical rings.
Computer Networks, 2003

Minimizing Request Blocking in All-Optical Rings.
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

Canonicity and Completeness Results for Many-Valued Modal Logics.
Journal of Applied Non-Classical Logics, 2002

Routing and path multicoloring.
Inf. Process. Lett., 2001