The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Sukhamay Kundu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. G. Barbara Demo, Sukhamay Kundu
    Analysis of the Context Dependency of CODASYL Find-Statements with Application to Database Program Conversion. [Citation Graph (5, 7)][DBLP]
    SIGMOD Conference, 1985, pp:354-361 [Conf]
  2. Sukhamay Kundu
    An Improved Algorithm for Finding a Key of a Relation. [Citation Graph (1, 5)][DBLP]
    PODS, 1985, pp:189-192 [Conf]
  3. Sukhamay Kundu
    The concept of path-closed subsets and its use in software functional design. [Citation Graph (0, 0)][DBLP]
    APSEC, 2000, pp:112-119 [Conf]
  4. Sukhamay Kundu
    The Canonical Functional Design Based on the Domination-Relationship among Data. [Citation Graph (0, 0)][DBLP]
    APSEC, 2001, pp:89-96 [Conf]
  5. Sukhamay Kundu
    Finite-State Modeling in Software Design: Some Fundamental Techniques. [Citation Graph (0, 0)][DBLP]
    APSEC, 2002, pp:317-0 [Conf]
  6. Sukhamay Kundu
    Modeling Complex Systems by A Set of Interacting Finite-State Models. [Citation Graph (0, 0)][DBLP]
    APSEC, 2003, pp:380-389 [Conf]
  7. Sukhamay Kundu, Nigel Gwee
    A Formal Approach to Designing a Class-Subclass Structure Using a Partial-Order on the Functions. [Citation Graph (0, 0)][DBLP]
    COMPSAC (1), 2005, pp:213-220 [Conf]
  8. Sukhamay Kundu
    A Modern Graphic Flowchart Layout Tool. [Citation Graph (0, 0)][DBLP]
    ICDCIT, 2004, pp:329-335 [Conf]
  9. Sukhamay Kundu
    A New Logic of Beliefs: Monotonic and Non-Monotonic Beliefs - Part 1. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1991, pp:486-491 [Conf]
  10. Jianhua Chen, Sukhamay Kundu
    The Strong Semantics for Logic Programs. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1991, pp:490-499 [Conf]
  11. Jianhua Chen, Sukhamay Kundu
    A Sound and Complete Fuzzy Logic System Using Zadeh's Implication Operator. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1996, pp:233-242 [Conf]
  12. Sukhamay Kundu
    Rule-Discovery from Examples Using a Combination of Syntactic and Semantic Information. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1987, pp:333-340 [Conf]
  13. Sukhamay Kundu
    A Correct Form of the Satisfiability-Graph Based Decision Algorithm for Linear Propositional Temporal Logic. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1988, pp:454-465 [Conf]
  14. Sukhamay Kundu
    A Better Fitness Measure of a Text-Document for a Given Set of Keywords. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1999, pp:217-225 [Conf]
  15. Sukhamay Kundu, Jianhua Chen
    Fuzzy Logic or Lukasiewicz Logic: A Clarification. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1994, pp:56-64 [Conf]
  16. Damayanti Datta, Sukhamay Kundu
    Reliable and Efficient Data Transfer in Wireless Sensor Networks via Out-of-Sequence Forwarding and Delayed Request for Missing Packets. [Citation Graph (0, 0)][DBLP]
    ITNG, 2007, pp:128-133 [Conf]
  17. Sukhamay Kundu
    Deadlock-Free Distributed Relaxed Mutual-Exclusion Without Revoke-Messages. [Citation Graph (0, 0)][DBLP]
    IWDC, 2005, pp:463-474 [Conf]
  18. Sukhamay Kundu, Jianhua Chen
    A New and Simple Method for Explicit Computation of a Circumscription. [Citation Graph (0, 0)][DBLP]
    GWAI, 1990, pp:160-170 [Conf]
  19. Sukhamay Kundu
    A new variant of the A-algorithm which closes a node at most once. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1991, v:4, n:, pp:157-176 [Journal]
  20. Sukhamay Kundu
    The Equivalence of the Subregion Representation and the Wall Representation for a Certain Class of Rectangular Dissections. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1988, v:31, n:6, pp:752-763 [Journal]
  21. Sukhamay Kundu
    The normal form of a granular fuzzy function. [Citation Graph (0, 0)][DBLP]
    Fuzzy Sets and Systems, 2001, v:124, n:1, pp:97-107 [Journal]
  22. Sukhamay Kundu, Jianhua Chen
    A New Method of Circumscribing Beliefs: The Propositional Case. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:29, n:4, pp:383-390 [Journal]
  23. Sukhamay Kundu
    An optimal O(N2) algorithm for computing the min-transitive closure of a weighted graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:5-6, pp:215-220 [Journal]
  24. Sukhamay Kundu
    A Linear Algorithm for the Hamiltonian Completion Number of a Tree. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1976, v:5, n:2, pp:55-57 [Journal]
  25. Sukhamay Kundu
    Sorting Tree, Nestling Tree and Inverse Permutation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1977, v:6, n:3, pp:94-96 [Journal]
  26. Sukhamay Kundu
    An Intermediate-Value Theorem for Optimum Tree Valuation. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:8, n:3, pp:141-145 [Journal]
  27. G. Barbara Demo, Sukhamay Kundu
    Modeling the CODASYL DML context dependency for database program conversion. [Citation Graph (0, 0)][DBLP]
    Inf. Syst., 1986, v:11, n:1, pp:87-100 [Journal]
  28. Sukhamay Kundu
    The Chartrand-Schuster conjecture: Graphs with unique distance trees are regular. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1977, v:22, n:3, pp:233-245 [Journal]
  29. Sukhamay Kundu, Jianhua Chen
    A new class of theories for which circumscription can be obtained via the predicate completion. [Citation Graph (0, 0)][DBLP]
    J. Exp. Theor. Artif. Intell., 1996, v:8, n:2, pp:191-205 [Journal]
  30. Sukhamay Kundu
    A better fitness measure of a text-document for a given set of keywords. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2000, v:33, n:5, pp:841-848 [Journal]
  31. Sukhamay Kundu
    Conflating two polygonal lines. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2006, v:39, n:3, pp:363-372 [Journal]
  32. Sukhamay Kundu
    A new O(n*log n) algorithm for computing the intersection of convex polygons. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1987, v:20, n:4, pp:419-424 [Journal]
  33. Sukhamay Kundu
    A solution to histogram-equalization and other related problems by shortest path methods. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1998, v:31, n:3, pp:231-234 [Journal]
  34. Sukhamay Kundu
    Gravitational clustering: a new approach based on the spatial distribution of the points. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1999, v:32, n:7, pp:1149-1160 [Journal]
  35. Sukhamay Kundu, Radhakrishnan Sridhar
    An O(kN.log N) algorithm for decomposing a set of polygons into d-separable components. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1990, v:23, n:7, pp:735-743 [Journal]
  36. Sukhamay Kundu, Jianhua Chen
    Learning rules from numerical data by combining geometric and graph-theoretic approach. [Citation Graph (0, 0)][DBLP]
    Robotics and Autonomous Systems, 2000, v:33, n:2-3, pp:135-147 [Journal]
  37. Sukhamay Kundu
    Existence of Graphs with Three Spanning Trees and Given Degree Sequence. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1974, v:3, n:4, pp:296-298 [Journal]
  38. Sukhamay Kundu
    An O(n) Algorithm for Determining the Subregion-Tree Representation of a Rectangular Dissection. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:79-101 [Journal]
  39. Sukhamay Kundu, Jayadev Misra
    A Linear Tree Partitioning Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:1, pp:151-154 [Journal]
  40. Sukhamay Kundu
    Minimal Strings in a Regular Language with Respect to a Partial Order on the Alphabet. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:83, n:2, pp:287-300 [Journal]
  41. Sukhamay Kundu
    Note on a Constrained-Path Problem in Program Testing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1978, v:4, n:1, pp:75-76 [Journal]
  42. Sukhamay Kundu
    The Call-Return Tree and Its Application to Program Performance Analysis. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1986, v:12, n:11, pp:1096-1101 [Journal]
  43. Sukhamay Kundu
    Structuring Software Functional Requirements For Automated Design And Verification. [Citation Graph (0, 0)][DBLP]
    COMPSAC (1), 2007, pp:127-136 [Conf]
  44. Sukhamay Kundu
    Using data-integrity constraints in model-based design. [Citation Graph (0, 0)][DBLP]
    SEDE, 2007, pp:288-295 [Conf]
  45. Nigel Gwee, Sukhamay Kundu
    A software tool for optimal class-hierarchy design based on the use-relationship among functions and variables. [Citation Graph (0, 0)][DBLP]
    SEDE, 2007, pp:326-331 [Conf]

  46. An O(V) algorithm M for computing transitive reduction of a planar acyclic digraph. [Citation Graph (, )][DBLP]


  47. Finding Shortest Multi-Paths with O(N2) Message Complexity. [Citation Graph (, )][DBLP]


  48. EasyMAC: A New and Simple Protocol for Slot Assignment. [Citation Graph (, )][DBLP]


  49. Teaching Software Modeling and Design Based on The Science of Design and Science of Learning. [Citation Graph (, )][DBLP]


  50. Content-Model Based Course Design for Active Learning, Critical Thinking and Creativity. [Citation Graph (, )][DBLP]


  51. Shape Recognition Using a New Spatial Representation and a D.P. Matching Algorithm. [Citation Graph (, )][DBLP]


  52. Requirements Engineering by Connecting Requirements Directly to Data and Operations during Modeling. [Citation Graph (, )][DBLP]


  53. A Distributed O(|E|) Algorithm for Optimal Link-Reversal. [Citation Graph (, )][DBLP]


  54. Orthogonal Decomposition of Finite-State Behavior Models As a Basis for Determining Components in Software Architectures. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.007secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002