Travelled to:1 × Denmark
1 × Finland
1 × Hungary
1 × Israel
1 × Latvia
Collaborated with:P.G.Spirakis C.Raptopoulos M.Yung G.B.Mertzios J.H.Reif K.V.Palem
Talks about:graph (4) random (3) intersect (2) network (2) memori (2) short (2) local (2) multiconnect (1) construct (1) stochast (1)
Person: Sotiris E. Nikoletseas
DBLP: Nikoletseas:Sotiris_E=
Facilitated 2 volumes:
EdEdContributed to:
20142013200419951994Wrote 5 papers:
- ICALP-v1-2014-MertziosNRS #interactive #memory management #network
- Determining Majority in Networks with Local Interactions and Very Small Local Memory (GBM, SEN, CR, PGS), pp. 871–882.
- ICALP-v2-2013-SpirakisNR #graph #random
- A Guided Tour in Random Intersection Graphs (PGS, SEN, CR), pp. 29–35.
- ICALP-2004-NikoletseasRS #graph #independence #performance #random #scalability #set
- The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs (SEN, CR, PGS), pp. 1029–1040.
- ICALP-1995-NikoletseasRSY #graph #memory management #probability
- Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time (SEN, JHR, PGS, MY), pp. 159–170.
- ICALP-1994-NikolestseasPSY #graph #multi #network #random #reliability
- Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing (SEN, KVP, PGS, MY), pp. 508–519.