Search the dblp DataBase
Pierre Kelsen :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Pierre Kelsen An Information-Based View of Representational Coupling in Object-Oriented Systems. [Citation Graph (0, 0)][DBLP ] FASE, 2003, pp:216-230 [Conf ] Pierre Kelsen A declarative executable model for object-based systems based on functional decomposition. [Citation Graph (0, 0)][DBLP ] ICSOFT (1), 2006, pp:63-71 [Conf ] Pierre Kelsen A Simple Static Model for Understanding the Dynamic Behavior of Programs. [Citation Graph (0, 0)][DBLP ] IWPC, 2004, pp:46-51 [Conf ] Christian Glodt , Pierre Kelsen DEMOS: a tool for declarative executable modeling of object-based systems. [Citation Graph (0, 0)][DBLP ] OOPSLA Companion, 2006, pp:716-717 [Conf ] Xiaofeng Han , Pierre Kelsen , Vijaya Ramachandran , Robert Endre Tarjan Computing Minimal Spanning Subgraphs in Linear Time. [Citation Graph (0, 0)][DBLP ] SODA, 1992, pp:146-156 [Conf ] Pierre Kelsen , Vijaya Ramachandran On Finding Minimal 2-Connected Subgraphs. [Citation Graph (0, 0)][DBLP ] SODA, 1991, pp:178-187 [Conf ] Pierre Kelsen Fast Parallel Matching in Expander Graphs. [Citation Graph (0, 0)][DBLP ] SPAA, 1993, pp:293-299 [Conf ] Pierre Kelsen Ranking and Unranking Trees Using Regular Reductions. [Citation Graph (0, 0)][DBLP ] STACS, 1996, pp:581-592 [Conf ] Pierre Kelsen On the Parallel Complexity of Computing a Maximal Independent Set in a Hypergraph [Citation Graph (0, 0)][DBLP ] STOC, 1992, pp:339-350 [Conf ] Pierre Kelsen Neighborhood Graphs and Distributed Delta+1-Coloring. [Citation Graph (0, 0)][DBLP ] SWAT, 1996, pp:223-233 [Conf ] Pierre Kelsen , Sanjeev Mahajan , Ramesh Hariharan Approximate Hypergraph Coloring. [Citation Graph (0, 0)][DBLP ] SWAT, 1996, pp:41-52 [Conf ] Elias Dahlhaus , Marek Karpinski , Pierre Kelsen An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1992, v:42, n:6, pp:309-313 [Journal ] Oscar Garrido , Pierre Kelsen , Andrzej Lingas A Simple NC-Algorithm for a Maximal Independent set in a Hypergraph of Poly-Log Arboricity. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1996, v:58, n:2, pp:55-58 [Journal ] Pierre Kelsen An Optimal Parallel Algorithm for Maximal Matching. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1994, v:52, n:4, pp:223-228 [Journal ] Pierre Kelsen , Vijaya Ramachandran On Finding Minimal Two-Connected Subgraphs. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1995, v:18, n:1, pp:1-49 [Journal ] Noga Alon , Pierre Kelsen , Sanjeev Mahajan , Ramesh Hariharan Approximate Hypergraph Coloring. [Citation Graph (0, 0)][DBLP ] Nord. J. Comput., 1996, v:3, n:4, pp:425-439 [Journal ] Xiaofeng Han , Pierre Kelsen , Vijaya Ramachandran , Robert Endre Tarjan Computing Minimal Spanning Subgraphs in Linear Time. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:6, pp:1332-1358 [Journal ] Christian Glodt , Pierre Kelsen , Elke Pulvermueller DEMOCLES: a tool for executable modeling of platform-independent systems. [Citation Graph (0, 0)][DBLP ] OOPSLA Companion, 2007, pp:870-871 [Conf ] VCL, a Visual Language for Modelling Software Systems Formally. [Citation Graph (, )][DBLP ] A Modular Model Composition Technique. [Citation Graph (, )][DBLP ] A Lightweight Approach for Defining the Formal Semantics of a Modeling Language. [Citation Graph (, )][DBLP ] From platform-independent to platform-specific models using democles. [Citation Graph (, )][DBLP ] Domain Hierarchies: A Basic Theoretical Framework for Integrating Software Domains. [Citation Graph (, )][DBLP ] Search in 0.019secs, Finished in 0.020secs