Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArun Sharma 0001
Person information
- affiliation: Queensland University of Technology, Brisbane, Australia
- affiliation: University of New South Wales, School of Computer Science and Engineering, Sydney, Australia
Other persons with the same name
- Arun Sharma — disambiguation page
- Arun Sharma 0002
![[0000-0002-9404-4519]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-9404-4519")
— Indira Gandhi Delhi Technical University for Women, Department of Information Technology, New Delhi, India (and 3 more) - Arun Sharma 0003 — University of California, Department of Mathematics, Berkeley, CA, USA
- Arun Sharma 0004 — State University of New York at Albany, ILS Institute, Albany, NY, USA
- Arun Sharma 0005 — RMIT University, School of Electrical and Computer Engineering, Melbourne, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j38]Eric Martin, Arun Sharma, Frank Stephan:
On the data consumption benefits of accepting increased uncertainty. Theor. Comput. Sci. 382(3): 170-182 (2007)- [p1]Eric Martin, Arun Sharma, Frank Stephan:
Deduction, Induction, and beyond in Parametric Logic. Induction, Algorithmic Learning Theory, and Philosophy 2007: 55-110 - 2006
- [j37]John Case, Sanjay Jain, Eric Martin, Arun Sharma, Frank Stephan:
Identifying Clusters from Positive Data. SIAM J. Comput. 36(1): 28-55 (2006) - [j36]Eric Martin, Arun Sharma, Frank Stephan:
Unifying logic, topology and learning in Parametric logic. Theor. Comput. Sci. 350(1): 103-124 (2006) - [j35]Eric Martin, Arun Sharma, Frank Stephan:
On ordinal VC-dimension and some notions of complexity. Theor. Comput. Sci. 364(1): 62-76 (2006) - 2005
- [c39]Eric Martin, Arun Sharma:
On a Syntactic Characterization of Classification with a Mind Change Bound. COLT 2005: 413-428 - 2004
- [j34]Arun Sharma, Frank Stephan, Yuri Ventsov:
Generalized notions of mind change complexity. Inf. Comput. 189(2): 235-262 (2004) - [j33]John Case, Efim B. Kinber, Arun Sharma, Frank Stephan:
On the classification of recursive languages. Inf. Comput. 192(1): 15-40 (2004) - [j32]Aleksandar Ignjatovic, Arun Sharma:
Some applications of logic to feasibility in higher types. ACM Trans. Comput. Log. 5(2): 332-350 (2004) - [c38]Eric Martin, Arun Sharma, Frank Stephan:
On the Data Consumption Benefits of Accepting Increased Uncertainty. ALT 2004: 83-98 - [c37]Arun Sharma:
Web Searching and S 2 Queries. APWeb 2004: 20-23 - [c36]John Case, Sanjay Jain, Eric Martin, Arun Sharma, Frank Stephan:
Identifying Clusters from Positive Data. ICGI 2004: 103-114 - [i2]John Case, Sanjay Jain, Eric Martin, Arun Sharma, Frank Stephan:
Identifying Clusters from Positive Data. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j31]Eric Martin, Arun Sharma, Frank Stephan:
Learning power and language expressiveness. Theor. Comput. Sci. 298(2): 365-383 (2003) - [c35]Eric Martin, Arun Sharma, Frank Stephan:
On Ordinal VC-Dimension and Some Notions of Complexity. ALT 2003: 54-68 - 2002
- [j30]John Case, Matthias Ott, Arun Sharma, Frank Stephan:
Learning to Win Process-Control Games Watching Game-Masters. Inf. Comput. 174(1): 1-19 (2002) - [j29]Sanjay Jain, Arun Sharma:
Mind change complexity of learning logic programs. Theor. Comput. Sci. 284(1): 143-160 (2002) - [j28]Osamu Watanabe, Arun Sharma:
Preface. Theor. Comput. Sci. 288(2): 195-196 (2002) - [c34]Eric Martin, Arun Sharma, Frank Stephan:
Learning, Logic, and Topology in a Common Framework. ALT 2002: 248-262 - [c33]Eric Martin, Phuong Minh Nguyen, Arun Sharma, Frank Stephan:
Learning in Logic with RichProlog. ICLP 2002: 239-254 - [i1]Aleksandar Ignjatovic, Arun Sharma:
Some applications of logic to feasibility in higher types. CoRR cs.LO/0204045 (2002) - 2001
- [j27]Sanjay Jain, Arun Sharma:
On a Generalized Notion of Mistake Bounds. Inf. Comput. 166(2): 156-166 (2001) - [j26]John Case, Sanjay Jain, Arun Sharma:
Synthesizing noise-tolerant language learners. Theor. Comput. Sci. 261(1): 31-56 (2001) - [j25]John Case, Sanjay Jain, Susanne Kaufmann, Arun Sharma, Frank Stephan:
Predictive learning models for concept drift. Theor. Comput. Sci. 268(2): 323-349 (2001) - [c32]Eric Martin, Arun Sharma, Frank Stephan:
A General Theory of Deduction, Induction, and Learning. Discovery Science 2001: 228-242 - 2000
- [j24]John Case, Sanjay Jain, Matthias Ott, Arun Sharma, Frank Stephan:
Robust Learning Aided by Context. J. Comput. Syst. Sci. 60(2): 234-257 (2000) - [j23]Sanjay Jain, Arun Sharma:
Team Learning of Computable Languages. Theory Comput. Syst. 33(1): 35-58 (2000) - [e2]Hiroki Arimura, Sanjay Jain, Arun Sharma:
Algorithmic Learning Theory, 11th International Conference, ALT 2000, Sydney, Australia, December 11-13, 2000, Proceedings. Lecture Notes in Computer Science 1968, Springer 2000, ISBN 3-540-41237-9 [contents]
1990 – 1999
- 1999
- [j22]Andris Ambainis, Sanjay Jain, Arun Sharma:
Ordinal Mind Change Complexity of Language Identification. Theor. Comput. Sci. 220(2): 323-343 (1999) - [c31]Andrew R. Mitchell, Tobias Scheffer, Arun Sharma, Frank Stephan:
The VC-Dimension of Subclasses of Pattern. ALT 1999: 93-105 - [c30]Sanjay Jain, Arun Sharma:
On a Generalized Notion of Mistake Bounds. COLT 1999: 249-256 - [c29]Sanjay Jain, Arun Sharma:
Mind Change Complexity of Learning Logic Programs. EuroCOLT 1999: 198-213 - [c28]Eric Martin, Arun Sharma:
On Sufficient Conditions for Learnability of Logic Programs from Positive Data. ILP 1999: 198-209 - 1998
- [j21]Sanjay Jain, Arun Sharma:
Generalization and Specialization Strategies for Learning r.e. Languages. Ann. Math. Artif. Intell. 23(1-2): 1-26 (1998) - [j20]Arun Sharma:
A Note on Batch and Incremental Learnability. J. Comput. Syst. Sci. 56(3): 272-276 (1998) - [c27]John Case, Matthias Ott, Arun Sharma, Frank Stephan:
Learning to Win Process-Control Games Watching Game-Masters. ALT 1998: 31-45 - [c26]John Case, Sanjay Jain, Susanne Kaufmann, Arun Sharma, Frank Stephan:
Predictive Learning Models for Concept Drift. ALT 1998: 276-290 - [c25]Eric McCreath, Arun Sharma:
LIME: A System for Learning Relations. ALT 1998: 336-374 - [c24]John Case, Sanjay Jain, Matthias Ott, Arun Sharma, Frank Stephan:
Robust Learning Aided by Context. COLT 1998: 44-55 - 1997
- [j19]Sanjay Jain, Arun Sharma:
Characterizing Language Identification in Terms of Computable Numberings. Ann. Pure Appl. Log. 84(1): 51-72 (1997) - [j18]Sanjay Jain, Arun Sharma:
Elementary Formal Systems, Intrinsic Complexity, and Procrastination. Inf. Comput. 132(1): 65-84 (1997) - [j17]Sanjay Jain, Arun Sharma:
The Structure of Intrinsic Complexity of Learning. J. Symb. Log. 62(4): 1187-1201 (1997) - [j16]Ganesh Baliga, Sanjay Jain, Arun Sharma:
Learning from Multiple Sources of Inaccurate Data. SIAM J. Comput. 26(4): 961-990 (1997) - [c23]John Case, Sanjay Jain, Arun Sharma:
Synthesizing Noise-Tolerant Language Learners. ALT 1997: 228-243 - [c22]Arun Sharma, Frank Stephan, Yuri Ventsov:
Generalized Notions of Mind Change Complexity. COLT 1997: 96-108 - [c21]Andris Ambainis, Sanjay Jain, Arun Sharma:
Ordinal Mind Change Complexity of Language Identification. EuroCOLT 1997: 301-315 - [c20]Eric McCreath, Arun Sharma:
ILP with Noise and Fixed Example Size: A Bayesian Approach. IJCAI 1997: 1310-1315 - [c19]John Case, Efim B. Kinber, Arun Sharma, Frank Stephan:
On the Classification of Computable Languages. STACS 1997: 225-236 - 1996
- [j15]John Case, Sanjay Jain, Arun Sharma:
Machine Induction Without Revolutionary Changes in Hypothesis Size. Inf. Comput. 128(2): 73-86 (1996) - [j14]Sanjay Jain, Arun Sharma:
Computational Limits on Team Identification of Languages. Inf. Comput. 130(1): 19-60 (1996) - [j13]Sanjay Jain, Arun Sharma:
The Intrinsic Complexity of Language Identification. J. Comput. Syst. Sci. 52(3): 393-402 (1996) - [j12]John Case, Sanjay Jain, Arun Sharma:
Anomalous Learning Helps Succinctness. Theor. Comput. Sci. 164(1&2): 13-28 (1996) - [c18]Sanjay Jain, Arun Sharma:
Elementary Formal Systems, Intrinsic Complexity, and Procrastination. COLT 1996: 181-192 - [c17]Sanjay Jain, Arun Sharma:
Team Learning of Recursive Languages. PRICAI 1996: 324-335 - [e1]Setsuo Arikawa, Arun Sharma:
Algorithmic Learning Theory, 7th International Workshop, ALT '96, Sydney, Australia, October 23-25, 1996, Proceedings. Lecture Notes in Computer Science 1160, Springer 1996, ISBN 3-540-61863-5 [contents] - 1995
- [j11]John Case, Sanjay Jain, Arun Sharma:
Complexity Issues for Vacillatory Function Identification. Inf. Comput. 116(2): 174-192 (1995) - [j10]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) - [j9]Sanjay Jain, Arun Sharma:
Prudence in Vacillatory Language Identification. Math. Syst. Theory 28(3): 267-279 (1995) - [j8]Sanjay Jain, Arun Sharma:
On Aggregating Teams of Learning Machines. Theor. Comput. Sci. 137(1): 85-108 (1995) - [c16]John Case, Sanjay Jain, Arun Sharma:
Machine Induction Without Revolutionary Paradigm Shifts. ALT 1995: 153-168 - [c15]Sanjay Jain, Arun Sharma:
The structure of intrinsic complexity of learning. EuroCOLT 1995: 169-181 - [c14]Sanjay Jain, Arun Sharma:
On Identification by Teams and Probabilistic Machines. GOSLER Final Report 1995: 108-145 - 1994
- [j7]Sanjay Jain, Arun Sharma:
Characterizing Language Identification by Standardizing Operations. J. Comput. Syst. Sci. 49(1): 96-107 (1994) - [j6]John Case, Sanjay Jain, Arun Sharma:
Vacillatory Learning of Nearly Minimal Size Grammars. J. Comput. Syst. Sci. 49(2): 189-207 (1994) - [j5]Sanjay Jain, Arun Sharma:
Program Size Restrictions in Computational Learning. Theor. Comput. Sci. 127(2): 351-386 (1994) - [c13]Sanjay Jain, Arun Sharma:
On Monotonic Strategies for Learning r.e. Languages. AII/ALT 1994: 349-364 - [c12]Sanjay Jain, Arun Sharma:
On the Intrinsic Complexity of Language Identification. COLT 1994: 278-286 - 1993
- [j4]Sanjay Jain, Arun Sharma:
Learning with the Knowledge of an Upper Bound on Program Size. Inf. Comput. 102(1): 118-166 (1993) - [j3]Sanjay Jain, Arun Sharma:
On the Non-Existence of Maximal Inference Degrees for Language Identification. Inf. Process. Lett. 47(2): 81-88 (1993) - [c11]Sanjay Jain, Arun Sharma:
On Aggregating Teams of Learning Machines. ALT 1993: 150-163 - [c10]Sanjay Jain, Arun Sharma:
Probability is More Powerful Than Team for Language Identification from Positive Data. COLT 1993: 192-198 - 1992
- [j2]John Case, Sanjay Jain, Arun Sharma:
On Learning Limiting Programs. Int. J. Found. Comput. Sci. 3(1): 93-115 (1992) - [c9]Ganesh Baliga, Sanjay Jain, Arun Sharma:
Learning from Multiple Sources of Inaccurate Data. AII 1992: 108-128 - [c8]Sanjay Jain, Arun Sharma:
Prudence in Vacillatory Language Identification (Extended Abstract). ALT 1992: 159-168 - [c7]John Case, Sanjay Jain, Arun Sharma:
On Learning Limiting Programs. COLT 1992: 193-202 - 1991
- [j1]Sanjay Jain, Arun Sharma:
Learning in the Presence of Partial Explanations. Inf. Comput. 95(2): 162-191 (1991) - [c6]John Case, Sanjay Jain, Arun Sharma:
Complexity Issues for Vacillatory Function Identification. FSTTCS 1991: 121-140 - 1990
- [c5]John Case, Sanjay Jain, Arun Sharma:
Anomalous Learning Helps Succinctness (Extended Abstract). ALT 1990: 282-288 - [c4]Sanjay Jain, Arun Sharma:
Finite Learning by a "Team". COLT 1990: 163-177 - [c3]Sanjay Jain, Arun Sharma:
Language Learning by a "Team" (Extended Abstract). ICALP 1990: 153-166 - [c2]Sanjay Jain, Arun Sharma:
Hypothesis Formation and Language Acquisition with an Infinitely-Often Correct Teacher. TARK 1990: 225-239
1980 – 1989
- 1989
- [c1]Sanjay Jain, Arun Sharma, John Case:
Convergence to Nearly Minimal Size Grammars by Vacillating Learning Machines. COLT 1989: 189-199
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-07-18 20:59 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:
