default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMahendran Velauthapillai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j16]Bala Kalyanasundaram, Mahe Velauthapillai:
Learning Behaviors of Functions with Teams. Fundam. Informaticae 124(3): 251-270 (2013)- 2012
- [j15]Bala Kalyanasundaram, Mahe Velauthapillai:
A Near Optimal Periodic Transmission Schedule in Bounded Degree Wireless Sensor Network. Theory Comput. Syst. 51(4): 474-491 (2012) - 2011
- [c21]Bala Kalyanasundaram, Mahe Velauthapillai:
Analysis of a Simple Randomized Protocol to Establish Communication in Bounded Degree Sensor Networks. ICDCN 2011: 269-280 - 2010
- [j14]Bala Kalyanasundaram, Mahe Velauthapillai:
Learning Behaviors of Functions. Fundam. Informaticae 98(2-3): 183-198 (2010)
2000 – 2009
- 2008
- [j13]Bala Kalyanasundaram, Mahendran Velauthapillai:
Taming teams with mind changes. J. Comput. Syst. Sci. 74(4): 513-526 (2008) - 2007
- [c20]Natarajan Ganesan, Bala Kalyanasundaram, Mahe Velauthapillai:
Bioinformatics Data Profiling Tools: A Prelude to Metabolic Profiling. Pacific Symposium on Biocomputing 2007: 127-132 - 2006
- [j12]Bala Kalyanasundaram, Mahendran Velauthapillai:
Capabilities of Thoughtful Machines. Fundam. Informaticae 74(2-3): 329-340 (2006) - 2005
- [j11]Bala Kalyanasundaram, Mahendran Velauthapillai, John G. Waclawsky:
Unlocking the Advantages of Dynamic Service Selection and Pricing. Theory Comput. Syst. 38(4): 393-410 (2005) - 2004
- [c19]Bala Kalyanasundaram, Mahendran Velauthapillai:
Fairness to All While Downsizing. ICALP 2004: 819-830 - 2003
- [c18]Bala Kalyanasundaram, Mahendran Velauthapillai, John G. Waclawsky:
Unlocking the Advantages of Dynamic Service Selection and Pricing. CIAC 2003: 46-57 - [c17]Bala Kalyanasundaram, Mahendran Velauthapillai:
On-Demand Broadcasting Under Deadline. ESA 2003: 313-324 - 2000
- [c16]Bala Kalyanasundaram, Kirk Pruhs, Mahendran Velauthapillai:
Scheduling Broadcasts in Wireless Networks. ESA 2000: 290-301
1990 – 1999
- 1998
- [j10]William I. Gasarch, Mark G. Pleszkoch, Frank Stephan, Mahendran Velauthapillai:
Classification Using Information. Ann. Math. Artif. Intell. 23(1-2): 147-168 (1998) - 1997
- [j9]William I. Gasarch, Mahendran Velauthapillai:
Asking Questions Versus Verifiability. Fundam. Informaticae 30(1): 1-9 (1997) - 1995
- [j8]Sanjay Jain, Arun Sharma
, Mahendran Velauthapillai:
Finite Identification of Functions by Teams with Success Ratio 1\over2 and Above. Inf. Comput. 121(2): 201-213 (1995) - [j7]Efim B. Kinber, Carl H. Smith, Mahendran Velauthapillai, Rolf Wiehagen:
On Learning Multiple Concepts in Parallel. J. Comput. Syst. Sci. 50(1): 41-52 (1995) - [j6]Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai:
Breaking the Probability 1/2 Barrier in FIN-Type Learning. J. Comput. Syst. Sci. 50(3): 574-599 (1995) - [c15]Bala Kalyanasundaram, Mahendran Velauthapillai:
Simulating Teams with Many Conjectures. ALT 1995: 201-214 - [c14]William I. Gasarch, Mark G. Pleszkoch, Mahendran Velauthapillai:
Classification Using Information. GOSLER Final Report 1995: 162-173 - 1994
- [j5]Robert P. Daley, Bala Kalyanasundaram, Mahe Velauthapillai:
The power of probabilism in Popperian FINite learning. J. Exp. Theor. Artif. Intell. 6(1): 41-62 (1994) - [c13]William I. Gasarch, Mark G. Pleszkoch, Mahendran Velauthapillai:
Classification Using Information. AII/ALT 1994: 290-300 - [c12]John G. Waclawsky, Mahendran Velauthapillai:
Dynamics of token ring protocols. ICNP 1994: 239-246 - 1993
- [c11]Efim B. Kinber, Carl H. Smith, Mahendran Velauthapillai, Rolf Wiehagen:
On Learning Multiple Concepts in Parallel. COLT 1993: 175-181 - [c10]Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai:
Capabilities of fallible FINite Learning. COLT 1993: 199-208 - 1992
- [j4]William I. Gasarch, Ramesh K. Sitaraman, Carl H. Smith, Mahendran Velauthapillai:
Learning programs with an easy to calculate set of errors. Fundam. Informaticae 16(3-4): 355-370 (1992) - [j3]Mahendran Velauthapillai:
Approximate learning with multiple machines. Fundam. Informaticae 17(3): 235-251 (1992) - [c9]Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai:
The Power of Probabilism in Popperian FINite Learning (extended abstract). AII 1992: 151-169 - [c8]William I. Gasarch, Mahendran Velauthapillai:
Asking Questions Versus Verifiability. AII 1992: 197-213 - [c7]Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai:
Breaking the Probability 1/2 Barrier in FIN-Type Learning. COLT 1992: 203-217 - 1991
- [c6]Robert P. Daley, Leonard Pitt, Mahendran Velauthapillai, Todd Will:
Relations Between Probabilistic and Team One-Shot Learners (Extended Abstract). COLT 1991: 228-239 - 1990
- [j2]Carl H. Smith, Mahendran Velauthapillai:
On the Inference of Approximate Programs. Theor. Comput. Sci. 77(3): 249-266 (1990)
1980 – 1989
- 1989
- [j1]Rusins Freivalds, Carl H. Smith, Mahendran Velauthapillai:
Trade-Off among Parameters Effecting Inductive Inference. Inf. Comput. 82(3): 323-349 (1989) - [c5]William I. Gasarch, Ramesh K. Sitaraman, Carl H. Smith, Mahendran Velauthapillai:
Learning Programs With an Easy to Calculate Set of Errors. AII 1989: 124-137 - [c4]Mahendran Velauthapillai:
Inductive Inference with Bounded Number of Mind Changes. COLT 1989: 200-213 - 1988
- [c3]William I. Gasarch, Ramesh K. Sitaraman, Carl H. Smith, Mahendran Velauthapillai:
Learning Programs with an Easy to Calculate Set of Errors. COLT 1988: 242-250 - [c2]John C. Cherniavsky, Mahendran Velauthapillai, Richard Statman:
Inductive Inference: An Abstract Approach. COLT 1988: 251-266 - 1986
- [c1]Carl H. Smith, Mahendran Velauthapillai:
On the Inference of Programs Approximately Computing the Desired Function. AII 1986: 164-176
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
