Search the dblp DataBase
Mahendran Velauthapillai: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai
The Power of Probabilism in Popperian FINite Learning (extended abstract). [Citation Graph (0, 0)][DBLP]
AII, 1992, pp:151-169 [Conf] - William I. Gasarch, Ramesh K. Sitaraman, Carl H. Smith, Mahendran Velauthapillai
Learning Programs With an Easy to Calculate Set of Errors. [Citation Graph (0, 0)][DBLP]
AII, 1989, pp:124-137 [Conf] - William I. Gasarch, Mahendran Velauthapillai
Asking Questions Versus Verifiability. [Citation Graph (0, 0)][DBLP]
AII, 1992, pp:197-213 [Conf] - Carl H. Smith, Mahendran Velauthapillai
On the Inference of Programs Approximately Computing the Desired Function. [Citation Graph (0, 0)][DBLP]
AII, 1986, pp:164-176 [Conf] - William I. Gasarch, Mark G. Pleszkoch, Mahendran Velauthapillai
Classification Using Information. [Citation Graph (0, 0)][DBLP]
AII/ALT, 1994, pp:290-300 [Conf] - Bala Kalyanasundaram, Mahendran Velauthapillai
Simulating Teams with Many Conjectures. [Citation Graph (0, 0)][DBLP]
ALT, 1995, pp:201-214 [Conf] - Bala Kalyanasundaram, Mahendran Velauthapillai, John G. Waclawsky
Unlocking the Advantages of Dynamic Service Selection and Pricing. [Citation Graph (0, 0)][DBLP]
CIAC, 2003, pp:46-57 [Conf] - John C. Cherniavsky, Mahendran Velauthapillai, Richard Statman
Inductive Inference: An Abstract Approach. [Citation Graph (0, 0)][DBLP]
COLT, 1988, pp:251-266 [Conf] - Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai
Breaking the Probability 1/2 Barrier in FIN-Type Learning. [Citation Graph (0, 0)][DBLP]
COLT, 1992, pp:203-217 [Conf] - Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai
Capabilities of fallible FINite Learning. [Citation Graph (0, 0)][DBLP]
COLT, 1993, pp:199-208 [Conf] - Robert P. Daley, Leonard Pitt, Mahendran Velauthapillai, Todd Will
Relations Between Probabilistic and Team One-Shot Learners (Extended Abstract). [Citation Graph (0, 0)][DBLP]
COLT, 1991, pp:228-239 [Conf] - William I. Gasarch, Ramesh K. Sitaraman, Carl H. Smith, Mahendran Velauthapillai
Learning Programs with an Easy to Calculate Set of Errors. [Citation Graph (0, 0)][DBLP]
COLT, 1988, pp:242-250 [Conf] - Efim B. Kinber, Carl H. Smith, Mahendran Velauthapillai, Rolf Wiehagen
On Learning Multiple Concepts in Parallel. [Citation Graph (0, 0)][DBLP]
COLT, 1993, pp:175-181 [Conf] - Mahendran Velauthapillai
Inductive Inference with Bounded Number of Mind Changes. [Citation Graph (0, 0)][DBLP]
COLT, 1989, pp:200-213 [Conf] - Bala Kalyanasundaram, Kirk Pruhs, Mahendran Velauthapillai
Scheduling Broadcasts in Wireless Networks. [Citation Graph (0, 0)][DBLP]
ESA, 2000, pp:290-301 [Conf] - Bala Kalyanasundaram, Mahendran Velauthapillai
On-Demand Broadcasting Under Deadline. [Citation Graph (0, 0)][DBLP]
ESA, 2003, pp:313-324 [Conf] - William I. Gasarch, Mark G. Pleszkoch, Mahendran Velauthapillai
Classification Using Information. [Citation Graph (0, 0)][DBLP]
GOSLER Final Report, 1995, pp:162-173 [Conf] - Bala Kalyanasundaram, Mahendran Velauthapillai
Fairness to All While Downsizing. [Citation Graph (0, 0)][DBLP]
ICALP, 2004, pp:819-830 [Conf] - William I. Gasarch, Mark G. Pleszkoch, Frank Stephan, Mahendran Velauthapillai
Classification Using Information. [Citation Graph (0, 0)][DBLP]
Ann. Math. Artif. Intell., 1998, v:23, n:1-2, pp:147-168 [Journal] - William I. Gasarch, Ramesh K. Sitaraman, Carl H. Smith, Mahendran Velauthapillai
Learning programs with an easy to calculate set of errors. [Citation Graph (0, 0)][DBLP]
Fundam. Inform., 1992, v:16, n:3-4, pp:355-370 [Journal] - William I. Gasarch, Mahendran Velauthapillai
Asking Questions Versus Verifiability. [Citation Graph (0, 0)][DBLP]
Fundam. Inform., 1997, v:30, n:1, pp:1-9 [Journal] - Mahendran Velauthapillai
Approximate learning with multiple machines. [Citation Graph (0, 0)][DBLP]
Fundam. Inform., 1992, v:17, n:3, pp:235-251 [Journal] - Bala Kalyanasundaram, Mahendran Velauthapillai
Capabilities of Thoughtful Machines. [Citation Graph (0, 0)][DBLP]
Fundam. Inform., 2006, v:74, n:2-3, pp:329-340 [Journal] - Rusins Freivalds, Carl H. Smith, Mahendran Velauthapillai
Trade-Off among Parameters Effecting Inductive Inference [Citation Graph (0, 0)][DBLP]
Inf. Comput., 1989, v:82, n:3, pp:323-349 [Journal] - Sanjay Jain, Arun Sharma, Mahendran Velauthapillai
Finite Identification of Functions by Teams with Success Ratio 1\over2 and Above [Citation Graph (0, 0)][DBLP]
Inf. Comput., 1995, v:121, n:2, pp:201-213 [Journal] - Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai
Breaking the Probability 1/2 Barrier in FIN-Type Learning. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1995, v:50, n:3, pp:574-599 [Journal] - Efim B. Kinber, Carl H. Smith, Mahendran Velauthapillai, Rolf Wiehagen
On Learning Multiple Concepts in Parallel. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1995, v:50, n:1, pp:41-52 [Journal] - Bala Kalyanasundaram, Mahendran Velauthapillai, John G. Waclawsky
Unlocking the Advantages of Dynamic Service Selection and Pricing. [Citation Graph (0, 0)][DBLP]
Theory Comput. Syst., 2005, v:38, n:4, pp:393-410 [Journal] - Carl H. Smith, Mahendran Velauthapillai
On the Inference of Approximate Programs. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1990, v:77, n:3, pp:249-266 [Journal]
Search in 0.002secs, Finished in 0.003secs
| 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 |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002