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

Search the dblp DataBase

Title:
Author:
Carl H. Smith: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dana Angluin, Carl H. Smith
    Inductive Inference: Theory and Methods. [Citation Graph (2, 0)][DBLP]
    ACM Comput. Surv., 1983, v:15, n:3, pp:237-269 [Journal]
  2. William I. Gasarch, Carl H. Smith
    On the Inference of Sequences of Functions. [Citation Graph (0, 0)][DBLP]
    AII, 1986, pp:23-41 [Conf]
  3. 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]
  4. Stuart A. Kurtz, Carl H. Smith
    A Refutation of Barzdins' Conjecture. [Citation Graph (0, 0)][DBLP]
    AII, 1989, pp:171-176 [Conf]
  5. 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]
  6. Rusins Freivalds, Carl H. Smith
    On the Duality Between Mechanistic Learners and What it is They Learn. [Citation Graph (0, 0)][DBLP]
    ALT, 1993, pp:137-149 [Conf]
  7. Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, William I. Gasarch, Carl H. Smith
    Team Learning as a Game. [Citation Graph (0, 0)][DBLP]
    ALT, 1997, pp:2-17 [Conf]
  8. Rusins Freivalds, Dace Gobleja, Marek Karpinski, Carl H. Smith
    Co-learnability and FIN-identifiability of Enumerable Classes of Total Recursive Functions. [Citation Graph (0, 0)][DBLP]
    AII/ALT, 1994, pp:100-105 [Conf]
  9. Carl H. Smith
    Three Decades of Team Learning. [Citation Graph (0, 0)][DBLP]
    AII/ALT, 1994, pp:211-228 [Conf]
  10. Michael M. Richter, Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann
    Editor's Introduction. [Citation Graph (0, 0)][DBLP]
    ALT, 1998, pp:1-10 [Conf]
  11. Hsieh-Chang Tu, Carl H. Smith
    Training Diagraphs. [Citation Graph (0, 0)][DBLP]
    AII/ALT, 1994, pp:176-186 [Conf]
  12. Kalvis Apsitis, Rusins Freivalds, Carl H. Smith
    On the Inductive Inference of Real Valued Functions. [Citation Graph (0, 0)][DBLP]
    COLT, 1995, pp:170-177 [Conf]
  13. Kalvis Apsitis, Rusins Freivalds, Carl H. Smith
    Asymmetric Team Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 1997, pp:90-95 [Conf]
  14. Rusins Freivalds, Efim B. Kinber, Carl H. Smith
    On the Impact of Forgetting on Learning Machines. [Citation Graph (0, 0)][DBLP]
    COLT, 1993, pp:165-174 [Conf]
  15. Rusins Freivalds, Marek Karpinski, Carl H. Smith
    Co-Learning of Total Recursive Functions. [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:190-197 [Conf]
  16. Rusins Freivalds, Carl H. Smith
    On the Role of Procrastination for Machine Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 1992, pp:363-376 [Conf]
  17. William I. Gasarch, Carl H. Smith
    Learning via Queries. [Citation Graph (0, 0)][DBLP]
    COLT, 1988, pp:227-241 [Conf]
  18. 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]
  19. Sanjay Jain, Carl H. Smith, Rolf Wiehagen
    On the Power of Learning Robustly. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:187-197 [Conf]
  20. Efim B. Kinber, William I. Gasarch, Thomas Zeugmann, Mark G. Pleszkoch, Carl H. Smith
    Learning Via Queries With Teams and Anomilies. [Citation Graph (0, 0)][DBLP]
    COLT, 1990, pp:327-337 [Conf]
  21. Efim B. Kinber, Christophe Papazian, Carl H. Smith, Rolf Wiehagen
    On the Intrinsic Complexity of Learning Recursive Functions. [Citation Graph (0, 0)][DBLP]
    COLT, 1999, pp:257-266 [Conf]
  22. 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]
  23. Stuart A. Kurtz, Carl H. Smith
    On the Role of Search for Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 1989, pp:303-311 [Conf]
  24. Rolf Wiehagen, Carl H. Smith
    Generalization versus Classification. [Citation Graph (0, 0)][DBLP]
    COLT, 1992, pp:224-230 [Conf]
  25. Janis Barzdins, Rusins Freivalds, Carl H. Smith
    A Logic of Discovery. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 1998, pp:401-402 [Conf]
  26. Janis Barzdins, Rusins Freivalds, Carl H. Smith
    Learning Formulae from Elementary Facts. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1997, pp:272-285 [Conf]
  27. Rusins Freivalds, Efim B. Kinber, Carl H. Smith
    On the intrinsic complexity of learning. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1995, pp:154-168 [Conf]
  28. Janis Barzdins, Rusins Freivalds, Carl H. Smith
    Towards Axiomatic Basis of Inductive Inference. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:1-13 [Conf]
  29. William I. Gasarch, Carl H. Smith
    Learning via Queries [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:130-137 [Conf]
  30. Carl H. Smith
    The Power of Parallelism for Automatic Program Synthesis [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:283-295 [Conf]
  31. Rusins Freivalds, Efim B. Kinber, Carl H. Smith
    Probabilistic versus Deterministic Memory Limited Learning. [Citation Graph (0, 0)][DBLP]
    GOSLER Final Report, 1995, pp:155-161 [Conf]
  32. Rolf Wiehagen, Carl H. Smith, Thomas Zeugmann
    Classifying Recursive Predicates and Languages. [Citation Graph (0, 0)][DBLP]
    GOSLER Final Report, 1995, pp:174-189 [Conf]
  33. Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan
    Measure, Category and Learning Theory. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:558-569 [Conf]
  34. Leonard Pitt, Carl H. Smith
    Probability and Plurality for Aggregations of Learning Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:1-10 [Conf]
  35. Rusins Freivalds, Carl H. Smith
    Category, Measure, Inductive Inference: A Triality Theorem and Its Applications. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:386-399 [Conf]
  36. Rusins Freivalds, Gints Tervits, Rolf Wiehagen, Carl H. Smith
    Learning Small Programs with Additional Information. [Citation Graph (0, 0)][DBLP]
    LFCS, 1997, pp:102-112 [Conf]
  37. Robert P. Daley, Carl H. Smith
    On the Complexity of Inductive Inference (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:255-264 [Conf]
  38. Carl H. Smith, Larry D. Wittie
    Discriminating Content Addressable Memories. [Citation Graph (0, 0)][DBLP]
    Sagamore Computer Conference, 1974, pp:100-101 [Conf]
  39. D. S. Tomer, Doug Baldwin, Carl H. Smith, Peter B. Henderson, Venu Vadisigi
    CS1 and CS2 (panel session): foundations of computer science and discrete mathematics. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2000, pp:397-398 [Conf]
  40. Andris Ambainis, Rusins Freivalds, Carl H. Smith
    General Inductive Inference Types Based on Linearly-Ordered Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:243-253 [Conf]
  41. Janis Barzdins, Rusins Freivalds, Carl H. Smith
    Learning with Confidence. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:207-218 [Conf]
  42. Kalvis Apsitis, Rusins Freivalds, Carl H. Smith
    Choosing a learning team: a topological approach. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:283-289 [Conf]
  43. Rusins Freivalds, Carl H. Smith
    Memory Limited Inductive Inference Machines. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:19-29 [Conf]
  44. Carl H. Smith
    Letter to the Editor. [Citation Graph (0, 0)][DBLP]
    AI Magazine, 2002, v:23, n:4, pp:4- [Journal]
  45. Carl H. Smith, William I. Gasarch
    Recursion Theoretic Models of Learning: Some Results and Intuitions. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1995, v:15, n:2, pp:151-166 [Journal]
  46. Karlis Cerans, Carl H. Smith
    Self-learning inductive inference machines. [Citation Graph (0, 0)][DBLP]
    Computational Intelligence, 1991, v:7, n:, pp:174-180 [Journal]
  47. Robert P. Daley, Carl H. Smith
    On the complextiy of inductive inference. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1984, v:23, n:, pp:22-27 [Journal]
  48. Rusins Freivalds, Efim B. Kinber, Carl H. Smith
    On the impact of forgetting on learing machines. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1993, v:51, n:, pp:212-225 [Journal]
  49. Rusins Freivalds, Efim B. Kinber, Carl H. Smith
    On the impact of forgetting on learing machines. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1993, v:49, n:, pp:212-225 [Journal]
  50. Andris Ambainis, Rusins Freivalds, Carl H. Smith
    Inductive Inference with Procrastination: Back to Definitions. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:40, n:1, pp:1-16 [Journal]
  51. Amihood Amir, Carl H. Smith
    The Syntax of Parallelism. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1993, v:19, n:3/4, pp:383-402 [Journal]
  52. William I. Gasarch, Efim B. Kinber, Mark G. Pleszkoch, Carl H. Smith, Thomas Zeugmann
    Learning via Queries with Teams and Anomalies. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1995, v:23, n:1, pp:67-89 [Journal]
  53. 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]
  54. Brian Postow, Kenneth W. Regan, Carl H. Smith
    UPSILON: Universal Programming System with Incomplete Lazy Object Notation. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:50, n:3-4, pp:325-359 [Journal]
  55. Kalvis Apsitis, Rusins Freivalds, Carl H. Smith
    On Duality in Learning and the Selection of Learning Terms. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:129, n:1, pp:53-62 [Journal]
  56. Robert P. Daley, Carl H. Smith
    On the Complexity of Inductive Inference [Citation Graph (0, 0)][DBLP]
    Information and Control, 1986, v:69, n:1-3, pp:12-40 [Journal]
  57. Rusins Freivalds, Efim B. Kinber, Carl H. Smith
    On the Intrinsic Complexity of Learning. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:123, n:1, pp:64-71 [Journal]
  58. Rusins Freivalds, Marek Karpinski, Carl H. Smith, Rolf Wiehagen
    Learning by the Process of Elimination. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:176, n:1, pp:37-50 [Journal]
  59. Rusins Freivalds, Carl H. Smith
    On the Role of Procrastination in Machine Learning [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:107, n:2, pp:237-271 [Journal]
  60. 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]
  61. Sanjay Jain, Efim B. Kinber, Christophe Papazian, Carl H. Smith, Rolf Wiehagen
    On the intrinsic complexity of learning recursive functions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:184, n:1, pp:45-70 [Journal]
  62. Leonard Pitt, Carl H. Smith
    Probability and Plurality for Aggregations of Learning Machines [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1988, v:77, n:1, pp:77-92 [Journal]
  63. Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann
    Classifying Predicates and Languages. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1997, v:8, n:1, pp:15-0 [Journal]
  64. Jan van Leeuwen, Carl H. Smith
    An Improved Bound for Detecting Looping Configurations in Deterministic DPA's. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1974, v:3, n:1, pp:22-24 [Journal]
  65. Hsieh-Chang Tu, Carl H. Smith
    Training Digraphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:53, n:4, pp:185-192 [Journal]
  66. Nam Sung Woo, Carl H. Smith, Ashok K. Agrawala
    A Proof of the Determinacy Property of the Data Flow Schema. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:1, pp:13-16 [Journal]
  67. Rusins Freivalds, Efim B. Kinber, Carl H. Smith
    On the Impact of Forgetting on Learning Machines. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:6, pp:1146-1168 [Journal]
  68. William I. Gasarch, Carl H. Smith
    Learning via Queries. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:3, pp:649-674 [Journal]
  69. Carl H. Smith
    The Power of Pluralism for Automatic Program Synthesis. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:4, pp:1144-1165 [Journal]
  70. Sanjay Jain, Carl H. Smith, Rolf Wiehagen
    Robust Learning Is Rich. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:1, pp:178-212 [Journal]
  71. 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]
  72. Rusins Freivalds, Efim B. Kinber, Carl H. Smith
    The functions of finite support: a canonical learning problem. [Citation Graph (0, 0)][DBLP]
    J. Exp. Theor. Artif. Intell., 1999, v:11, n:4, pp:543-552 [Journal]
  73. Stuart A. Kurtz, Carl H. Smith, Rolf Wiehagen
    On the role of search for learning from examples. [Citation Graph (0, 0)][DBLP]
    J. Exp. Theor. Artif. Intell., 2001, v:13, n:1, pp:25-43 [Journal]
  74. Michael J. O'Donnell, Carl H. Smith
    A Combinatorial Problem Concerning Processor Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1982, v:31, n:2, pp:163-164 [Journal]
  75. Carl H. Smith, Larry D. Wittie
    Memory Hardware for High Speed Job Selection. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1976, v:25, n:2, pp:148-156 [Journal]
  76. Dana Angluin, William I. Gasarch, Carl H. Smith
    Training Sequences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:66, n:3, pp:255-272 [Journal]
  77. Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, Carl H. Smith
    Hierarchies of probabilistic and team FIN-learning. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:261, n:1, pp:91-117 [Journal]
  78. Kalvis Apsitis, Setsuo Arikawa, Rusins Freivalds, Eiju Hirowatari, Carl H. Smith
    On the Inductive Inference of Recursive Real-Valued Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:219, n:1-2, pp:3-17 [Journal]
  79. Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan
    On the Relative Sizes of Learnable Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:197, n:1-2, pp:139-156 [Journal]
  80. 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]
  81. John C. Cherniavsky, Carl H. Smith
    A Recursion Theoretic Approach to Program Testing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1987, v:13, n:7, pp:777-784 [Journal]
  82. John C. Cherniavsky, Carl H. Smith
    On Weyuker's Axioms For Software Complexity Measures. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1991, v:17, n:6, pp:636-638 [Journal]

Search in 0.079secs, Finished in 0.082secs
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