PDF Document

Source URL: ceid.letras.unmsm.edu.pe

ΠΑΝΕΠΙΣΤΗΜΙΟ ΠΑΤΡΩΝ ΕΛΛΗΝΙΚΟ ΑΝΟΙΚΤΟ ΠΑΝΕΠΙΣΤΗΜΙΟ Το Πανεπιστήµιο Πατρών

Source URL: digitization.hpclab.ceid.upatras.gr

Atomic congestion games: fast, myopic and concurrent? Dimitris Fotakis3 , Alexis C. Kaporis1 , and Paul G. Spirakis1,2 1 Dept of Computer Eng and Informatics, University of Patras, 26500 Patras, Greece Research Academic

Source URL: students.ceid.upatras.gr

Dynamic Interpolation Search Revisited ? Alexis Kaporis1,2 , Christos Makris1 , Spyros Sioutas1 , Athanasios Tsakalidis1,2 , Kostas Tsichlas1 , and Christos Zaroliagis1,2

Source URL: students.ceid.upatras.gr

PDF Document

Source URL: students.ceid.upatras.gr

Approximating Almost All Instances of Max-Cut Within a Ratio Above the H˚ astad  Threshold A.C. Kaporis1 , L.M. Kirousis1,2 , and E.C. Stavropoulos1

Source URL: students.ceid.upatras.gr

Thresholds of Random k-Sat (2002; Kaporis, Kirousis, Lalas) A. C. Kaporis, Department of Computer Engineering and Informatics, University of Patras http://students.ceid.upatras.gr/˜kaporis L. M. Kirousis, Department of

Source URL: students.ceid.upatras.gr

Santa Fe Institute. August 24, 2005 3:16 p.m.

Source URL: students.ceid.upatras.gr

• Graph theory
• Mathematics
• Discrete mathematics
• Vertex
• Graph
• Degree
• Connectivity
• Graph coloring
• Line graph

Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone:

Source URL: students.ceid.upatras.gr

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Logic in computer science
• NP-complete problems
• Boolean algebra
• Boolean satisfiability problem
• Electronic design automation
• Symposium on Discrete Algorithms
• Approximation algorithm
• Random walk
• 2-satisfiability

Panepist mio Patr¸n Poluteqnik  Sqol  Tm ma Mhqanik¸n Hlektronik¸n Upologist¸n kai Plhroforik c Dr. Alèxioc K. Kapìrhc

Source URL: students.ceid.upatras.gr

• Theoretical computer science
• European Symposium on Algorithms
• Algorithm