Travelled to:1 × Brazil
1 × Canada
1 × Hungary
1 × Italy
1 × Portugal
1 × Spain
Collaborated with:A.K.Tsakalidis Y.Plegas S.Sioutas K.Tsichlas P.Vikatos J.Visser E.Theodoridis P.Antonellis N.Tsirakis Y.Panagis E.Sakkopoulos P.Bozanis N.Kitsios A.Kaplanis M.Kendea G.Tzimas G.S.Brodal G.Lagogiannis A.C.Kaporis C.D.Zaroliagis
Talks about:search (4) tree (2) web (2) use (2) edg (2) government (1) wikipedia (1) intersect (1) heterogen (1) algorithm (1)
Person: Christos Makris
DBLP: Makris:Christos
Contributed to:
201520132008
2006
20021995Wrote 8 papers:
- SAC-2015-KaplanisKSMT
- HB+tree: use hadoop and HBase even your data isn’t that big (AK, MK, SS, CM, GT), pp. 973–980.
- SAC-2015-MakrisVV #classification #predict
- Classification model for predicting cost slippage in governmental ICT projects (CM, PV, JV), pp. 1238–1241.
- SAC-2013-MakrisPT #wiki
- Improved text annotation with Wikipedia entities (CM, YP, ET), pp. 288–295.
- SAC-2008-AntonellisMT #clustering #documentation #named #summary #using #xml
- XEdge: clustering homogeneous and heterogeneous XML documents using edge summaries (PA, CM, NT), pp. 1081–1088.
- SAC-2008-MakrisPPS #algorithm #personalisation #web
- An integrated web system to facilitate personalized web searching algorithms (CM, YP, YP, ES), pp. 2397–2402.
- ICALP-v1-2006-KaporisMSTTZ #revisited
- Dynamic Interpolation Search Revisited (ACK, CM, SS, AKT, KT, CDZ), pp. 382–394.
- STOC-2002-BrodalLMTT #pointer
- Optimal finger search trees in the pointer machine (GSB, GL, CM, AKT, KT), pp. 583–591.
- ICALP-1995-BozanisKMT #bound #problem
- New Upper Bounds for Generalized Intersection Searching Problems (PB, NK, CM, AKT), pp. 464–474.