The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bernard Mans: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. William Duckworth, Bernard Mans
    Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:83-95 [Conf]
  2. Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, Igor Shparlinski
    On Routing in Circulant Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1999, pp:360-369 [Conf]
  3. William Duckworth, Bernard Mans
    On the Connected Domination Number of Random Regular Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:210-219 [Conf]
  4. Bernard Mans, Francesco Pappalardi, Igor Shparlinski
    On the Ádám Conjecture on Circulant Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:251-260 [Conf]
  5. Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John Michael Robson
    On Recognizing Cayley Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:76-87 [Conf]
  6. Bernard Mans, Nicola Santoro
    Optimal Fault-Tolerant Leader Election in Chordal Rings. [Citation Graph (0, 0)][DBLP]
    FTCS, 1994, pp:392-401 [Conf]
  7. Bernard Mans, Nicola Santoro
    On the Impact of Sense of Direction in Arbitrary Networks. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1994, pp:258-265 [Conf]
  8. Leonidas Georgiadis, Philippe Jacquet, Bernard Mans
    Bandwidth Reservation in Multihop Wireless Networks: Complexity and Mechanisms. [Citation Graph (0, 0)][DBLP]
    ICDCS Workshops, 2004, pp:762-767 [Conf]
  9. Franck Cappello, Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg
    HiHCoHP: Toward a Realistic Communication Model for Hierarchical HyperClusters of Heterogeneous Processors. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2001, pp:42- [Conf]
  10. Bernard Mans
    On the Interval Routing of Chordal Rings. [Citation Graph (0, 0)][DBLP]
    ISPAN, 1999, pp:16-21 [Conf]
  11. Bernard Mans, Igor Shparlinski
    Bisecting and Gossiping in Circulant Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:589-598 [Conf]
  12. Paola Flocchini, Bernard Mans, Alessandro Roncato, Nicola Santoro
    Levels of Sense of Direction in Distributed Systems. [Citation Graph (0, 0)][DBLP]
    OPODIS, 1997, pp:319-331 [Conf]
  13. Pierre Fraigniaud, Cyril Gavoille, Bernard Mans
    Interval routing schemes allow broadcasting with linear message-complexity (extended abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 2000, pp:11-20 [Conf]
  14. William Duckworth, Bernard Mans
    Small k-Dominating Sets of Regular Graphs. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:126-138 [Conf]
  15. Paola Flocchini, Bernard Mans, Nicola Santoro
    Preface. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1994, pp:- [Conf]
  16. Paola Flocchini, Bernard Mans, Nicola Santoro
    Sense of Direction: Formal Definitions and Properties. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1994, pp:9-34 [Conf]
  17. Paola Flocchini, Bernard Mans, Nicola Santoro
    Translation Capabilities of Sense of Direction. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1995, pp:13-25 [Conf]
  18. Bernard Mans
    Optimal Distributed Algorithms in Unlabelled Tori and Chordal Rings. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1996, pp:17-31 [Conf]
  19. Paola Flocchini, Bernard Mans, Nicola Santoro
    Sense of Direction in Distributed Computing. [Citation Graph (0, 0)][DBLP]
    DISC, 1998, pp:1-15 [Conf]
  20. Bernard Mans
    Portable distributed priority queues with MPI. [Citation Graph (0, 0)][DBLP]
    Concurrency - Practice and Experience, 1998, v:10, n:3, pp:175-198 [Journal]
  21. Bernard Mans, Catherine Roucairol
    Performances of Parallel Branch and Bound Algorithms with Best-first Search. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:66, n:1, pp:57-74 [Journal]
  22. Pierre Fraigniaud, Cyril Gavoille, Bernard Mans
    Interval routing schemes allow broadcasting with linear message-complexity. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2001, v:14, n:4, pp:217-229 [Journal]
  23. Bernard Mans, Francesco Pappalardi, Igor Shparlinski
    On the spectral Ádám property for circulant graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:309-329 [Journal]
  24. Franck Cappello, Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg
    An algorithmic model for heterogeneous hyper-clusters: rationale and experience. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:2, pp:195-215 [Journal]
  25. Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Bernard Mans, Andrzej Pelc
    Optimal Coteries and Voting Schemes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:1, pp:1-6 [Journal]
  26. Paola Flocchini, Bernard Mans, Nicola Santoro
    On the Impact of Sense of Direction on Message Complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:1, pp:23-31 [Journal]
  27. Bruce E. Litow, Bernard Mans
    A Note on the Ádám Conjecture for Double Loops. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:66, n:3, pp:149-153 [Journal]
  28. Paola Flocchini, Bernard Mans
    Optimal Elections in Labeled Hypercubes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:33, n:1, pp:76-83 [Journal]
  29. Pierre Fraigniaud, Bernard Mans, Arnold L. Rosenberg
    Efficient trigger-broadcasting in heterogeneous clusters. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2005, v:65, n:5, pp:628-642 [Journal]
  30. Bernard Mans
    Optimal Distributed Algorithms in Unlabeled Tori and Chordal Rings. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1997, v:46, n:1, pp:80-90 [Journal]
  31. Paola Flocchini, Bernard Mans, Nicola Santoro
    Sense of direction: Definitions, properties, and classes. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:32, n:3, pp:165-180 [Journal]
  32. William Duckworth, Bernard Mans
    Randomized greedy algorithms for finding small k-dominating sets of regular graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:27, n:3, pp:401-412 [Journal]
  33. Bernard Mans, Nicola Santoro
    Optimal Elections in Faulty Loop Networks and Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1998, v:47, n:3, pp:286-297 [Journal]
  34. Paola Flocchini, Bernard Mans, Nicola Santoro
    Sense of direction in distributed computing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:291, n:1, pp:29-53 [Journal]

  35. Information Propagation Speed in Mobile and Delay Tolerant Networks. [Citation Graph (, )][DBLP]


  36. On Space-Time Capacity Limits in Mobile and Delay Tolerant Networks. [Citation Graph (, )][DBLP]


  37. Tree Decontamination with Temporary Immunity. [Citation Graph (, )][DBLP]


  38. Exploration of Periodically Varying Graphs. [Citation Graph (, )][DBLP]


  39. Routing in Intermittently Connected Networks: Age Rumors in Connected Components. [Citation Graph (, )][DBLP]


  40. Distributed Disaster Disclosure. [Citation Graph (, )][DBLP]


  41. Energy-Efficient Virtual Backbones for Reception-Aware MANET. [Citation Graph (, )][DBLP]


  42. Information Propagation Speed in Mobile and Delay Tolerant Networks [Citation Graph (, )][DBLP]


  43. Exploration of Periodically Varying Graphs [Citation Graph (, )][DBLP]


  44. On Space-Time Capacity Limits in Mobile and Delay Tolerant Networks [Citation Graph (, )][DBLP]


  45. Connected domination of regular graphs. [Citation Graph (, )][DBLP]


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