The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jean-Claude König: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Olivier Cogis, Jean-Claude König, Jérôme Palaysi
    On the List Colouring Problem. [Citation Graph (0, 0)][DBLP]
    ASIAN, 2002, pp:47-56 [Conf]
  2. Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
    Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1999, pp:369-372 [Conf]
  3. Aristotelis Giannakos, Jean-Claude König, Alix Munier
    On the Cyclic Scheduling Problem with Small Communication Delays (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Euro-Par, Vol. II, 1996, pp:578-581 [Conf]
  4. Rodolphe Giroudeau, Jean-Claude König, Feryal-Kamila Moulaï, Jérôme Palaysi
    Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communication Delays. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2005, pp:252-261 [Conf]
  5. Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud
    Broadcasting and Multicasting in Cut-through Routed Networks. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:734-738 [Conf]
  6. E. Ahronovitz, Jean-Claude König, C. Saad
    A distributed method for dynamic resolution of BGP oscillations. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  7. Rodolphe Giroudeau, Jean-Claude König
    General Non-Approximability Results in Presence of Hierarchical Communications. [Citation Graph (0, 0)][DBLP]
    ISPDC/HeteroPar, 2004, pp:312-319 [Conf]
  8. Evripidis Bampis, Jean-Claude König, Denis Trystram
    Optimal Parallel Execution of Complete Binary Trees and Grids into most Popular Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    PARLE, 1994, pp:122-133 [Conf]
  9. Alexis Irlande, Jean-Claude König, Christian Laforest
    Construction of low-cost and low-diameter Steiner trees for multipoint groups. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:197-210 [Conf]
  10. Evripidis Bampis, Charles Delorme, Jean-Claude König
    Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:655-666 [Conf]
  11. Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
    An Approximation Algorithm for the Precedence Constrained Scheduling Problem with Hierarchical Communications. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:443-454 [Conf]
  12. Jean-Claude Bermond, Jean-Claude König, Michel Raynal
    General and Efficient Decentralized Consensus Protocols. [Citation Graph (0, 0)][DBLP]
    WDAG, 1987, pp:41-56 [Conf]
  13. Jean-Claude König, Emmanuel Lazard
    Minimum k-broadcast graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:199-209 [Journal]
  14. Pierre Fraigniaud, Jean-Claude König, Emmanuel Lazard
    Oriented hypercubes. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:39, n:2, pp:98-106 [Journal]
  15. Jean-Claude König, David W. Krumme, Emmanuel Lazard
    Diameter-preserving orientations of the torus. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:32, n:1, pp:1-11 [Journal]
  16. Evripidis Bampis, Charles Delorme, Jean-Claude König
    Optimal Schedules for d-D Grid Graphs with Communication Delays. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1998, v:24, n:11, pp:1653-1664 [Journal]
  17. Evripidis Bampis, Jean-Claude König, Denis Trystram
    Impact of communications on the complexity of the parallel Gaussian Elimination. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1991, v:17, n:1, pp:55-61 [Journal]
  18. Abdelmadjid Bouabdallah, Jean-Claude König
    An Improvement of Maekawa's Mutual Exclusion Algorithm to Make It Fault-Tolerant. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1992, v:2, n:, pp:283-290 [Journal]
  19. Abdelmadjid Bouabdallah, Jean-Claude König
    An Improvement of the Maekawa's Mutual Exclusion Algorithm to Make it Fault-Tolerant. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1993, v:3, n:, pp:305- [Journal]
  20. Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
    Using Duplication for the Multiprocessor Scheduling Problem with Hierarchical Communications. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 2000, v:10, n:1, pp:133-140 [Journal]
  21. Evripidis Bampis, Jean-Claude König, Denis Trystram
    A Low Overhead Schedule for a 3D-Grid Graph. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1992, v:2, n:, pp:363-372 [Journal]
  22. Evripidis Bampis, Rodolphe Giroudeau, Jean-Claude König
    An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1883-1895 [Journal]
  23. Evripidis Bampis, Jean-Claude König, Denis Trystram
    Optimal Parallel Execution of Complete Binary Trees and Grids Into Most Popular Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:147, n:1&2, pp:1-18 [Journal]
  24. Abdel Krim Amoura, Evripidis Bampis, Jean-Claude König
    Scheduling Algorithms for Parallel Gaussian Elimination With Communication Costs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:7, pp:679-686 [Journal]
  25. Johanne Cohen, Pierre Fraigniaud, Jean-Claude König, André Raspaud
    Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:8, pp:788-802 [Journal]
  26. Jean-Claude König, Dominique Sotteau
    Symmetric routings of the hypercube. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:121, n:1-3, pp:123-134 [Journal]

  27. The mv-decomposition: definition and application to the distance-2 broadcast problem in multi-hops radio networks. [Citation Graph (, )][DBLP]


  28. AT-Angle: A distributed method for localization using angles in sensor networks. [Citation Graph (, )][DBLP]


  29. Ellipse Routing: A Geographic Routing Protocol for Mobile Sensor Networks with Uncertain Positions. [Citation Graph (, )][DBLP]


  30. Extensions de réseaux de connexité donnée. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.282secs
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