The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mark K. Goldberg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Eric Breimer, Mark K. Goldberg, Brian Kolstad, Malik Magdon-Ismail
    Experimental Evaluation of the Height of a Random Set of Points in a d-Dimensional Cube. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:161-171 [Conf]
  2. Mark K. Goldberg, Thomas H. Spencer
    A New Parallel Algorithm for the Maximal Independent Set Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:161-165 [Conf]
  3. Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena
    Graph Drawing and Manipulation with LINK. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:425-437 [Conf]
  4. Jeffrey Baumes, Mark K. Goldberg, Mukkai S. Krishnamoorthy, Malik Magdon-Ismail, Nathan Preston
    Finding communities by clustering a graph into overlapping subgraphs. [Citation Graph (0, 0)][DBLP]
    IADIS AC, 2005, pp:97-104 [Conf]
  5. Seyit Ahmet Çamtepe, Mark K. Goldberg, Malik Magdon-Ismail, Mukkai Krishn
    Detecting conversing groups of chatters: a model, algorithms, and tests. [Citation Graph (0, 0)][DBLP]
    IADIS AC, 2005, pp:89-96 [Conf]
  6. Jeffrey Baumes, Mark K. Goldberg, Mykola Hayvanovych, Malik Magdon-Ismail, William A. Wallace, Mohammed Javeed Zaki
    Finding Hidden Group Structure in a Stream of Communications. [Citation Graph (0, 0)][DBLP]
    ISI, 2006, pp:201-212 [Conf]
  7. Jeffrey Baumes, Mark K. Goldberg, Malik Magdon-Ismail
    Efficient Identification of Overlapping Communities. [Citation Graph (0, 0)][DBLP]
    ISI, 2005, pp:27-36 [Conf]
  8. Malik Magdon-Ismail, Mark K. Goldberg, William A. Wallace, David Siebecker
    Locating Hidden Groups in Communication Networks Using Hidden Markov Models. [Citation Graph (0, 0)][DBLP]
    ISI, 2003, pp:126-137 [Conf]
  9. Eric Breimer, Mark K. Goldberg
    Learning Significant Alignments: An Alternative to Normalized Local Alignment. [Citation Graph (0, 0)][DBLP]
    ISMIS, 2002, pp:37-45 [Conf]
  10. Mark K. Goldberg, Darren T. Lim, Malik Magdon-Ismail
    A learning algorithm for string assembly. [Citation Graph (0, 0)][DBLP]
    BIOKDD, 2001, pp:31-37 [Conf]
  11. Dave A. Berque, Mark K. Goldberg, Jeffrey A. Edmonds
    Implementing Progress Indicators for Recursive Algorithms. [Citation Graph (0, 0)][DBLP]
    SAC, 1993, pp:533-538 [Conf]
  12. Jonathan W. Berry, Mark K. Goldberg
    Path Optimization and Near-Greedy Analysis for Graph Partitioning: An Empirical Study. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:223-232 [Conf]
  13. Mark K. Goldberg, Thomas H. Spencer
    An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:219-225 [Conf]
  14. Mark K. Goldberg, D. Hollinger, Malik Magdon-Ismail
    Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:513-523 [Conf]
  15. Jonathan W. Berry, Mark K. Goldberg
    Path Optimization for Graph Partitioning Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:90, n:1-3, pp:27-50 [Journal]
  16. Mark K. Goldberg, D. L. Hollinger
    Designing algorithms by sampling. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:1, pp:59-75 [Journal]
  17. Derek G. Corneil, Mark K. Goldberg
    A Non-Factorial Algorithm for Canonical Numbering of a Graph. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:3, pp:345-362 [Journal]
  18. Mark K. Goldberg
    Construction of class 2 graphs with maximum vertex degree 3. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:31, n:3, pp:282-291 [Journal]
  19. Eric Breimer, Mark K. Goldberg, Darren T. Lim
    A learning algorithm for the longest common subsequence problem. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2003, v:8, n:, pp:- [Journal]
  20. Dave A. Berque, R. Cecchini, Mark K. Goldberg, R. Rivenburgh
    The Set Player System for Symbolic Computation on Power Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1992, v:14, n:6, pp:645-662 [Journal]
  21. Mark K. Goldberg, Thomas H. Spencer
    A New Parallel Algorithm for the Maximal Independent Set Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:2, pp:419-427 [Journal]
  22. Mark K. Goldberg, Thomas H. Spencer
    Constructing a Maximal Independent Set in Parallel. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:3, pp:322-328 [Journal]
  23. Mark K. Goldberg, Thomas H. Spencer
    An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:3, pp:443-459 [Journal]
  24. Jonathan W. Berry, Nathaniel Dean, Mark K. Goldberg, Gregory E. Shannon, Steven Skiena
    LINK: a system for graph computation. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 2000, v:30, n:11, pp:1285-1302 [Journal]
  25. Eric J. Griffith, Srinivas Akella, Mark K. Goldberg
    Performance Characterization of a Reconfigurable Planar-Array Digital Microfluidic System. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2006, v:25, n:2, pp:345-357 [Journal]
  26. Jeffrey Baumes, Mark K. Goldberg, Mykola Hayvanovych, Stephen Kelley, Malik Magdon-Ismail, Konstantin Mertsalov, William A. Wallace
    SIGHTS: A Software System for Finding Coalitions and Leaders in a Social Network. [Citation Graph (0, 0)][DBLP]
    ISI, 2007, pp:193-199 [Conf]
  27. Jeffrey Baumes, Mark K. Goldberg, Malik Magdon-Ismail, William A. Wallace
    Discovering Hidden Groups in Communication Networks. [Citation Graph (0, 0)][DBLP]
    ISI, 2004, pp:378-389 [Conf]
  28. Hung-Ching Chen, Mark K. Goldberg, Malik Magdon-Ismail
    Identifying Multi-ID Users in Open Forums. [Citation Graph (0, 0)][DBLP]
    ISI, 2004, pp:176-186 [Conf]

  29. Learning What Makes a Society Tick. [Citation Graph (, )][DBLP]


  30. Discover the power of social and hidden curriculum to decision making: experiments with enron email and movie newsgroups. [Citation Graph (, )][DBLP]


  31. Reverse Engineering an Agent-Based Hidden Markov Model for Complex Social Systems. [Citation Graph (, )][DBLP]


  32. A Generative Model for Statistical Determination of Information Content from Conversation Threads. [Citation Graph (, )][DBLP]


  33. A locality model of the evolution of blog networks. [Citation Graph (, )][DBLP]


  34. Communication Dynamics of Blog Networks. [Citation Graph (, )][DBLP]


  35. Stable Statistics of the Blogograph. [Citation Graph (, )][DBLP]


  36. Models of Communication Dynamics for Simulation of Information Diffusion. [Citation Graph (, )][DBLP]


  37. Clusters in a Multigraph with Elevated Density. [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