Automata, Languages and Programming
暂无分享,去创建一个
J. van Leeuwen | Jan van Leeuwen | Matthew Hennessy | Stephan Eidenbenz | Peter Widmayer | Ricardo Conejo | Rafael Morales | Francisco Triguero
[1] Peter Bro Miltersen,et al. Are bitvectors optimal? , 2000, STOC '00.
[2] Amnon Ta-Shma,et al. Loss-less condensers, unbalanced expanders, and extractors , 2001, STOC '01.
[3] J. B. Wells. Typability and type checking in the second-order Λ-calculus are equivalent and undecidable (Preliminary Draft) , 1993 .
[4] Rasmus Pagh,et al. On the cell probe complexity of membership and perfect hashing , 2001, STOC '01.
[5] Simona Ronchi Della Rocca. Principal Type Scheme and Unification for Intersection Type Discipline , 1988, Theor. Comput. Sci..
[6] John C. Reynolds,et al. Towards a theory of type structure , 1974, Symposium on Programming.
[7] J. B. Wells. Typability is Undecidable for F+Eta , 1996 .
[8] Amos Fiat,et al. Implicit O(1) Probe Search , 1993, SIAM J. Comput..
[9] J. Ian Munro,et al. Implicit Data Structures for Fast Search and Update , 1980, J. Comput. Syst. Sci..
[10] Pawel Urzyczyn,et al. Type reconstruction in Fω , 1997, Mathematical Structures in Computer Science.
[11] Jitka Stríbrná. Hardness results for weak bisimilarity of simple process algebras , 1998, Electron. Notes Theor. Comput. Sci..
[12] Colin Stirling,et al. Local model checking games (extended abstract) , 1995 .
[13] Steffen van Bakel,et al. Intersection Type Assignment Systems , 1995, Theor. Comput. Sci..
[14] S. V. Bakel,et al. Intersection type disciplines in Lambda Calculus and applicative term rewriting systems , 1993 .
[15] Friedhelm Meyer auf der Heide,et al. A New Universal Class of Hash Functions and Dynamic Hashing in Real Time , 1990, ICALP.
[16] James H. Morris,et al. Lambda-calculus models of programming languages. , 1969 .
[17] Faith Ellen,et al. Optimal bounds for the predecessor problem , 1999, STOC '99.
[18] János Komlós,et al. Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[19] Benjamin C. Pierce,et al. Bounded quantification is undecidable , 1992, POPL '92.
[20] Simona Ronchi Della Rocca,et al. Principal Type Schemes for an Extended Type Theory , 1984, Theor. Comput. Sci..
[21] Gerth Stølting Brodal,et al. Dynamic Representation of Sparse Graphs , 1999, WADS.
[22] P. Hall. On Representatives of Subsets , 1935 .
[23] Michael L. Fredman,et al. Surpassing the Information Theoretic Bound with Fusion Trees , 1993, J. Comput. Syst. Sci..
[24] Rasmus Pagh. A Trade-Off for Worst-Case Efficient Dictionaries , 2000, Nord. J. Comput..