The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yannis C. Stamatiou: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Effie Makri, Yannis C. Stamatiou
    Distributively Increasing the Percentage of Similarities Between Strings with Applications to Key Agreement. [Citation Graph (0, 0)][DBLP]
    ADHOC-NOW, 2006, pp:211-223 [Conf]
  2. Vasiliki Liagkou, Effie Makri, Paul G. Spirakis, Yannis C. Stamatiou
    The Threshold Behaviour of the Fixed Radius Random Graph Model and Applications to the Key Management Problem of Sensor Networks. [Citation Graph (0, 0)][DBLP]
    ALGOSENSORS, 2006, pp:130-139 [Conf]
  3. Elisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis
    On the Efficient Generation of Elliptic Curves over Prime Fields. [Citation Graph (0, 0)][DBLP]
    CHES, 2002, pp:333-348 [Conf]
  4. Dimitris Achlioptas, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Michael S. O. Molloy, Yannis C. Stamatiou
    Random Constraint Satisfaction: A More Accurate Picture. [Citation Graph (0, 0)][DBLP]
    CP, 1997, pp:107-120 [Conf]
  5. Nick Lendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos
    Partial Arc Consistency. [Citation Graph (0, 0)][DBLP]
    Over-Constrained Systems, 1995, pp:229-236 [Conf]
  6. Elisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis
    A Software Library for Elliptic Curve Cryptography. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:625-636 [Conf]
  7. Elisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis
    On the Use of Weber Polynomials in Elliptic Curve Cryptography. [Citation Graph (0, 0)][DBLP]
    EuroPKI, 2004, pp:335-349 [Conf]
  8. Elisavet Konstantinou, Vasiliki Liagkou, Paul G. Spirakis, Yannis C. Stamatiou, Moti Yung
    Electronic National Lotteries. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 2004, pp:147-163 [Conf]
  9. Nick D. Dendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos
    Partiality and Approximation Schemes for Local Consistency in Networks of Constraints. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:210-224 [Conf]
  10. Panayotis E. Nastou, Yannis C. Stamatiou
    Enhancing the Security of Block Ciphers with the Aid of Parallel Substitution Box Construction. [Citation Graph (0, 0)][DBLP]
    ICDCS Workshops, 2002, pp:29-34 [Conf]
  11. Elisavet Konstantinou, Aristides Kontogeorgis, Yannis C. Stamatiou, Christos D. Zaroliagis
    Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations. [Citation Graph (0, 0)][DBLP]
    ICISC, 2004, pp:261-278 [Conf]
  12. Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito
    Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:328-338 [Conf]
  13. Elisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis
    On the Construction of Prime Order Elliptic Curves. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2003, pp:309-322 [Conf]
  14. Panayotis E. Nastou, Yannis C. Stamatiou
    Dynamically Modifiable Ciphers Using a Reconfigurable CAST-128 Based Algorithm on ATMEL's FPSLIC(tm) Reconfigurable FPGA Architecture. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  15. Elisavet Konstantinou, Vasiliki Liagkou, Paul G. Spirakis, Yannis C. Stamatiou, Moti Yung
    "Trust Engineering: " From Requirements to System Design and Maintenance - A Working National Lottery System Experience. [Citation Graph (0, 0)][DBLP]
    ISC, 2005, pp:44-58 [Conf]
  16. Spyridoula M. Armeni, Dimitris Christodoulakis, Ioannis Kostopoulos, Polychronis D. Kountrias, Yannis C. Stamatiou, Michalis Nik Xenos
    An Information Hiding Method Based on Computational Intractable Problems. [Citation Graph (0, 0)][DBLP]
    Panhellenic Conference on Informatics, 2001, pp:262-278 [Conf]
  17. Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou
    Locating Information with Uncertainty in Fully Interconnected Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2000, pp:283-296 [Conf]
  18. Dimitrios Koukopoulos, Yannis C. Stamatiou
    An Efficient Watermarking Method for MP3 Audio Files. [Citation Graph (0, 0)][DBLP]
    IEC (Prague), 2005, pp:154-159 [Conf]
  19. T. Komninos, Yannis C. Stamatiou, G. Vavitsas
    A Worm Propagation Model Based on People's Email Acquaintance Profiles. [Citation Graph (0, 0)][DBLP]
    WINE, 2006, pp:343-352 [Conf]
  20. Alexis C. Kaporis, Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou, Elias C. Stavropoulos
    Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2001, v:44, n:4, pp:221-229 [Journal]
  21. Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou
    A Note on the Non-Colorability Threshold of a Random Graph. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  22. Dimitris Achlioptas, Michael S. O. Molloy, Lefteris M. Kirousis, Yannis C. Stamatiou, Evangelos Kranakis, Danny Krizanc
    Random Constraint Satisfaction: A More Accurate Picture. [Citation Graph (0, 0)][DBLP]
    Constraints, 2001, v:6, n:4, pp:329-344 [Journal]
  23. Nick D. Dendris, Lefteris M. Kirousis, Yannis C. Stamatiou, Dimitrios M. Thilikos
    On Parallel Partial Solutions and Approximation Schemes for Local Consistency in Networks of Constraints. [Citation Graph (0, 0)][DBLP]
    Constraints, 2000, v:5, n:3, pp:251-273 [Journal]
  24. Yannis C. Stamatiou
    Threshold Phenomena: The Computer Scientist's Viewpoint. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2003, v:80, n:, pp:199-234 [Journal]
  25. Elisavet Konstantinou, Yannis C. Stamatiou, Christos D. Zaroliagis
    Efficient generation of secure elliptic curves. [Citation Graph (0, 0)][DBLP]
    Int. J. Inf. Sec., 2007, v:6, n:1, pp:47-63 [Journal]
  26. Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou
    Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory. [Citation Graph (0, 0)][DBLP]
    Networks, 2003, v:42, n:3, pp:169-180 [Journal]
  27. Svante Janson, Yannis C. Stamatiou, Malvina Vamvakari
    Bounding the unsatisfiability threshold of random 3-SAT. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:17, n:2, pp:103-116 [Journal]
  28. Svante Janson, Yannis C. Stamatiou, Malvina Vamvakari
    Erratum to Bounding the Unsatisfiability Threshold of Random 3-SAT. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:18, n:1, pp:99-100 [Journal]
  29. Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou
    Approximating the unsatisfiability threshold of random formulas. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:12, n:3, pp:253-269 [Journal]
  30. E. C. Laskari, Gerasimos C. Meletiou, Yannis C. Stamatiou, Michael N. Vrahatis
    Applying evolutionary computation methods for the cryptanalysis of Feistel ciphers. [Citation Graph (0, 0)][DBLP]
    Applied Mathematics and Computation, 2007, v:184, n:1, pp:63-72 [Journal]
  31. A. Antoniou, C. Korakas, C. Manolopoulos, A. Panagiotaki, D. Sofotassios, Paul G. Spirakis, Yannis C. Stamatiou
    A Trust-Centered Approach for Building E-Voting Systems. [Citation Graph (0, 0)][DBLP]
    EGOV, 2007, pp:366-377 [Conf]
  32. Dimitrios Koukopoulos, Yannis C. Stamatiou
    A compressed-domain watermarking algorithm for mpeg audio layer 3. [Citation Graph (0, 0)][DBLP]
    MM&Sec, 2001, pp:7-10 [Conf]
  33. Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito
    The unsatisfiability threshold revisited. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:12, pp:1525-1538 [Journal]

  34. Trust in global computing systems as a limit property emerging from short range random interactions. [Citation Graph (, )][DBLP]


  35. A step-wise refinement approach for enhancing e-voting acceptance. [Citation Graph (, )][DBLP]


  36. Modeling the Co-evololution DNS Worms and Anti-worms in IPv6 Networks. [Citation Graph (, )][DBLP]


  37. A Queuing Theory Based Model for Studying Intrusion Evolution and Elimination in Computer Networks. [Citation Graph (, )][DBLP]


  38. A probabilistic key agreement scheme for sensor networks without key predistribution [Citation Graph (, )][DBLP]


Search in 0.119secs, Finished in 0.121secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002