The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Miroslaw Korzeniowski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Miroslaw Dynia, Miroslaw Korzeniowski, Christian Schindelhauer
    Power-Aware Collective Tree Exploration. [Citation Graph (0, 0)][DBLP]
    ARCS, 2006, pp:341-351 [Conf]
  2. Marcin Bienkowski, Miroslaw Korzeniowski
    Dynamic Page Migration Under Brownian Motion. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2005, pp:962-971 [Conf]
  3. Marcin Bienkowski, André Brinkmann, Miroslaw Korzeniowski, Orhan Orhan
    Cube Connected Cycles Based Bluetooth Scatternet Formation. [Citation Graph (0, 0)][DBLP]
    ICN (1), 2005, pp:413-420 [Conf]
  4. Marcin Bienkowski, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide
    Dynamic Load Balancing in Distributed Hash Tables. [Citation Graph (0, 0)][DBLP]
    IPTPS, 2005, pp:217-225 [Conf]
  5. Marcin Bienkowski, Miroslaw Korzeniowski
    Bounding Communication Cost in Dynamic Load Balancing of Distributed Hash Tables. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2005, pp:381-395 [Conf]
  6. Marcin Bienkowski, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide
    Fighting against two adversaries: page migration in dynamic networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:64-73 [Conf]
  7. Marcin Bienkowski, Miroslaw Korzeniowski, Harald Räcke
    A practical algorithm for constructing oblivious routing schemes. [Citation Graph (0, 0)][DBLP]
    SPAA, 2003, pp:24-33 [Conf]
  8. Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzeniowski
    Improved Algorithms for Dynamic Page Migration. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:365-376 [Conf]
  9. Miroslaw Dynia, Miroslaw Korzeniowski, Jaroslaw Kutylowski
    Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs. [Citation Graph (0, 0)][DBLP]
    SOFSEM (1), 2007, pp:260-271 [Conf]

  10. Heterogenous dating service with application to rumor spreading. [Citation Graph (, )][DBLP]


  11. Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environmen. [Citation Graph (, )][DBLP]


  12. Degree 3 Suffices: A Large-Scale Overlay for P2P Networks. [Citation Graph (, )][DBLP]


  13. Event Extent Estimation. [Citation Graph (, )][DBLP]


  14. Dynamic Sharing of a Multiple Access Channel. [Citation Graph (, )][DBLP]


  15. Dynamic sharing of a multiple access channel [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
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