Sukhamay Kundu

发表

An optimal O(N2) algorithm for computing the min-transitive closure of a weighted graph

Sukhamay Kundu, S. Kundu, 2000, Inf. Process. Lett..

A matroid generalization of a theorem of Mendelsohn and Dulmage

Sukhamay Kundu, Eugene L. Lawler, E. Lawler, 1973, Discret. Math..

Content-Model Based Course Design for Active Learning, Critical Thinking and Creativity

Sukhamay Kundu, 2009, FECS.

A New and Simple Method for Explicit Computation of a Circumscription

Sukhamay Kundu, Jianhua Chen, S. Kundu, 1990, GWAI.

A Distributed O(|E|) Algorithm for Optimal Link-Reversal

Sukhamay Kundu, 2009, ICDCN.

Structuring Software Functional Requirements For Automated Design And Verification

Sukhamay Kundu, 2007, 31st Annual International Computer Software and Applications Conference (COMPSAC 2007).

An O(n) Algorithm for Determining the Subregion-Tree Representation of a Rectangular Dissection

Sukhamay Kundu, 1993, SIAM J. Comput..

A Sound and Complete Fuzzy Logic System Using Zadeh's Implication Operator

Sukhamay Kundu, Jianhua Chen, 1996, ISMIS.

Learning rules from numerical data by combining geometric and graph-theoretic approach

Sukhamay Kundu, Jianhua Chen, 2000, Robotics Auton. Syst..

A Canonical Shape-Representation for a Polygon

Sukhamay Kundu, 2006 .

Random Generation of Combinatorial Structures using Context-Fee Grammars

Sukhamay Kundu, 2003, Electron. Notes Discret. Math..

The correct form of a recent result on level-subgroups of a fuzzy group

Sukhamay Kundu, 1998, Fuzzy Sets Syst..

Structuring Softwar eF unctional Requirements Fo rA utomated Design And Verification

Sukhamay Kundu, 2007 .

Reliable and Efficient Data Transfer in Wireless Sensor Networks via Out-of-Sequence Forwarding and Delayed Request for Missing Packets

Sukhamay Kundu, Damayanti Datta, 2007, Fourth International Conference on Information Technology (ITNG'07).

Deadlock-Free Distributed Relaxed Mutual-Exclusion Without Revoke-Messages

Sukhamay Kundu, 2005, IWDC.

Min-transitivity of fuzzy leftness relationship and its application to decision making

Sukhamay Kundu, S. Kundu, 1997, Fuzzy Sets Syst..

A linear time algorithm for optimal k-hop dominating set of a tree

Sukhamay Kundu, Subhashis Majumder, S. Kundu, 2016, Inf. Process. Lett..

A new O(n*log n) algorithm for computing the intersection of convex polygons

Sukhamay Kundu, 1987, Pattern Recognit..

Rule-Discovery from Examples Using a Combination of Syntactic and Semantic Information

Sukhamay Kundu, 1987, ISMIS.

Using data-integrity constraints in model-based design

Sukhamay Kundu, 2007, SEDE.

The call-return tree and its application to program performance analysis

Sukhamay Kundu, 1986, IEEE Transactions on Software Engineering.

A Correct Form of the Satisfiability-Graph Based Decision Algorithm for Linear Propositional Temporal Logic

Sukhamay Kundu, S. Kundu, 1988, International Syposium on Methodologies for Intelligent Systems.

The canonical functional design based on the domination-relationship among data

Sukhamay Kundu, 2001, Proceedings Eighth Asia-Pacific Software Engineering Conference.

Minimal Strings in a Regular Language with Respect to a Partial Order on the Alphabet

Sukhamay Kundu, 1991, Theor. Comput. Sci..

Existence of Graphs with Three Spanning Trees and Given Degree Sequence

Sukhamay Kundu, 1974, SIAM J. Comput..

A better fitness measure of a text-document for a given set of keywords

Sukhamay Kundu, 2000, Pattern Recognit..

Sukhamay Kundu, S. Kundu, 2000, Fuzzy Sets Syst..

Sorting Tree, Nestling Tree and Inverse Permutation

Sukhamay Kundu, 1977, Inf. Process. Lett..

The min-max composition rule and its superiority over the usual max-min composition rule

Sukhamay Kundu, 1998, Fuzzy Sets Syst..

A New Logic of Beliefs: Monotonic and Non-Monotonic Beliefs - Part 1

Sukhamay Kundu, 1991, IJCAI.

Reconstruction of a Pair of Graphs from their Concatenations

Sukhamay Kundu, James B. Shearer, Dean Sturtevant, 1980, SIAM J. Algebraic Discret. Methods.

A New Method of Circumscribing Beliefs: The Propositional Case

Sukhamay Kundu, Jianhua Chen, S. Kundu, 1997, Fundam. Informaticae.

An improved algorithm for finding a key of a relation

Sukhamay Kundu, 1985, PODS '85.

The Strong Semantics for Logic Programs

Sukhamay Kundu, Jianhua Chen, 1991, ISMIS.

Approximation of CFL by Regular Languages for Concurrent Program Verification

Sukhamay Kundu, Supratik Mukhopadhyay, S. Mukhopadhyay, 2010, 2010 IEEE 34th Annual Computer Software and Applications Conference Workshops.

EasyMAC: A New and Simple Protocol for Slot Assignment

Sukhamay Kundu, Jerrolyn Brees, 2008, ISCA PDCCS.

Analysis of the context dependency of CODASYL find-statements with application to a database program conversion

Sukhamay Kundu, G. Barbara Demo, 1985, SIGMOD '85.

A software tool for optimal class-hierarchy design based on the use-relationship among functions and variables

Sukhamay Kundu, Nigel Gwee, 2007, SEDE.

A generalized linear time algorithm for an optimal k-distance dominating set of a weighted tree

Sukhamay Kundu, 2018, Inf. Process. Lett..

The normal form of a granular fuzzy function

Sukhamay Kundu, 2001, Fuzzy Sets Syst..

A new variant of the A*-algorithm which closes a node at most once

Sukhamay Kundu, S. Kundu, 1991, Annals of Mathematics and Artificial Intelligence.

The k-factor conjecture is true

Sukhamay Kundu, 1973, Discret. Math..

A representation theorem for min-transitive fuzzy relations

Sukhamay Kundu, 2000, Fuzzy Sets Syst..

Conflating two polygonal lines

Sukhamay Kundu, 2006, Pattern Recognit..

Note on a Constrained-Path Problem in Program Testing

Sukhamay Kundu, 1978, IEEE Transactions on Software Engineering.

Broadcast in sparse conversion optical networks using fewest converters

Sukhamay Kundu, Tong Yi, S. Kundu, 2005 .

Gravitational clustering: a new approach based on the spatial distribution of the points

Sukhamay Kundu, S. Kundu, 1999, Pattern Recognit..

The equivalence of the subregion representation and the wall representation for a certain class of rectangular dissections

Sukhamay Kundu, 1988, CACM.

Finding Shortest Multi-Paths with O(N2) Message Complexity

Sukhamay Kundu, Jerrolyn Brees, 2008, ISCA PDCCS.

Fuzzy control system design by fuzzy clustering and self-organization

Sukhamay Kundu, Jianhua Chen, 1996, Proceedings of North American Fuzzy Information Processing.

The concept of path-closed subsets and its use in software functional design

Sukhamay Kundu, 2000, Proceedings Seventh Asia-Pacific Software Engeering Conference. APSEC 2000.

A Better Fitness Measure of a Text-Document for a Given Set of Keywords

Sukhamay Kundu, 1999, ISMIS.

An Application-Specific Reliable Data Transfer Protocol in Wireless Sensor Networks

Sukhamay Kundu, Damayanti Datta, 2008, J. Networks.

Peachy Parallel Assignments (EduHPC 2019)

Sukhamay Kundu, Steven Bogaerts, Alina Lazar, 2019, 2019 IEEE/ACM Workshop on Education for High-Performance Computing (EduHPC).

Preference relation on fuzzy utilities based on fuzzy leftness relation on intervals

Sukhamay Kundu, S. Kundu, 1998, Proceedings Mexico-USA Collaboration in Intelligent Systems Technologies..

Fuzzy Logic or Lukasiewicz Logic: A Clarification

Sukhamay Kundu, Jianhua Chen, 1994, ISMIS.

Complexity and heuristics in ruled-based algorithmic music composition

Sukhamay Kundu, Nigel Gwee, S. Kundu, 2002 .

Relationship between optimal k-distance dominating sets in a weighted graph and its spanning trees

Sukhamay Kundu, 2019, Inf. Process. Lett..

Orthogonal Decomposition of Finite-State Behavior Models As a Basis for Determining Components in Software Architectures

Sukhamay Kundu, 2008, SETP.

A solution to histogram-equalization and other related problems by shortest path methods

Sukhamay Kundu, S. Kundu, 1998, Pattern Recognit..

Peak-tree: a new approach to image simplification

Sukhamay Kundu, 1999, Optics & Photonics.

Finite-state modeling in software design: some fundamental techniques

Sukhamay Kundu, S. Kundu, 2002, Ninth Asia-Pacific Software Engineering Conference, 2002..

An O(V) algorithm M for computing transitive reduction of a planar acyclic digraph

Sukhamay Kundu, 1982, ACM-SE 20.

A Linear Tree Partitioning Algorithm

Sukhamay Kundu, Jayadev Misra, J. Misra, 1977, SIAM J. Comput..

Service-learning and Active-learning: An Experience-based Comparison

Sukhamay Kundu, 2010, FECS.

Modeling the CODASYL DML context dependency for database program conversion

Sukhamay Kundu, G. Barbara Demo, 1986, Inf. Syst..

Teaching Software Modeling and Design Based on The Science of Design and Science of Learning

Sukhamay Kundu, 2008, FECS.

A formal approach to designing a class-subclass structure using a partial-order on the functions

Sukhamay Kundu, Nigel Gwee, 2005, 29th Annual International Computer Software and Applications Conference (COMPSAC'05).

A factorization theorem for a certain class of graphs

Sukhamay Kundu, S. Kundu, 1974, Discret. Math..

Calibration of a constitutive model using genetic algorithms

Sukhamay Kundu, Surajit Pal, G. Wije Wathugala, 1996 .

A new class of theories for which circumscription can be obtained via the predicate completion

Sukhamay Kundu, Jianhua Chen, S. Kundu, 1996, J. Exp. Theor. Artif. Intell..

A Modern Graphic Flowchart Layout Tool

Sukhamay Kundu, S. Kundu, 2004, ICDCIT.

The Chartrand-Schuster conjecture: Graphs with unique distance trees are regular

Sukhamay Kundu, 1977, J. Comb. Theory, Ser. B.

A simple algorithm for learning a finite-state machine

Sukhamay Kundu, 1990 .

Concept of linear run and its application to image compression

Sukhamay Kundu, 1998, Optics & Photonics.

Modeling complex systems by a set of interacting finite-state models

Sukhamay Kundu, S. Kundu, 2003, Tenth Asia-Pacific Software Engineering Conference, 2003..

Generalizations of the k-factor theorem

Sukhamay Kundu, 1974, Discret. Math..

Shape Recognition Using a New Spatial Representation and a D.P. Matching Algorithm

Sukhamay Kundu, Shiyuan Gu, 2009, 2009 Seventh International Conference on Advances in Pattern Recognition.

Membership functions for a fuzzy group from similarity relations

Sukhamay Kundu, 1999, Fuzzy Sets Syst..

Fuzzy logic or Lukasiewicz logic: A clarification

Sukhamay Kundu, Jianhua Chen, 1998, Fuzzy Sets Syst..

Automated Test Case Generator.

Sukhamay Kundu, Daniel M Leach, 1980 .

Requirements Engineering by Connecting Requirements Directly to Data and Operations during Modeling

Sukhamay Kundu, 2009, 2009 Fourth International Conference on Software Engineering Advances.

An O(kN.log N) algorithm for decomposing a set of polygons into d-separable components

Sukhamay Kundu, Sridhar Radhakrishnan, S. Kundu, 1990, Pattern Recognit..

A Linear Algorithm for the Hamiltonian Completion Number of a Tree

Sukhamay Kundu, S. Kundu, 1976, Inf. Process. Lett..

Optimal information organization for web and other displays

Sukhamay Kundu, S. Kundu, 2011, 2011 World Congress on Information and Communication Technologies.

Bounds on the number of disjoint spanning trees

Sukhamay Kundu, S. Kundu, 1974 .

Reconstruction of a Tree from Its Homomorphic Images and Other Related Transforms

Sukhamay Kundu, E. Sampathkumar, V. N Bhave, 1976 .

Disjoint Representation of Tree Realizable Sequences

Sukhamay Kundu, 1974 .

Disjoint Representation of Three Tree Realizable Sequences. I

Sukhamay Kundu, S. Kundu, 1975 .

Replacing trapezoidal membership functions by triangular membership functions for /spl otimes/-transitivity

Sukhamay Kundu, 1999, 18th International Conference of the North American Fuzzy Information Processing Society - NAFIPS (Cat. No.99TH8397).