| A Characterization of the Minimum Cycle Mean in a Digraph | R. M. Karp | Discrete Mathematics (Netherlands), Vol. 23, No. 3, pp. 309-11 | September 1978 | Algorithms | |
| A Characterization of Space Complexity Cases and Subexponential Time Classesas Limiting Polynomially Decidable Sets | G. Ausiello, M. Protasi, and M. Angelaccio | ICSI Technical Report TR-91-046 | August 1991 | ICSI Technical Reports | [PDF]
|
| A Characterization of Rational Amalgamation Operations | V.Cutello and J. Montero | ICSI Technical Report TR-92-033 | May 1992 | ICSI Technical Reports | [PDF]
|
| A Characterization of Multi-Party Interactive Multimedia Applications | C. Szyperski and G. Ventre | ICSI Technical Report TR-93-006 | January 1993 | ICSI Technical Reports | [PDF]
|
| A Category-Level 3-D Object Dataset: Putting the Kinect to Work | A. Janoch, S. Karayev, Y. Jia, J. Y. Barron, M. Fritz, K. Saenko, and T. Darrell | Proceedings of the First IEEE Workshop on Consumer Depth Cameras for Computer Vision at the International Conference on Computer Vision (ICCV), Barcelona, Spain, pp. 1168-1174 | November 2011 | Vision | [PDF]
|
| A case study of SHRUTI | L. Shastri and D.J. Grannes | In Noetica: Open Forum, Vol. 2, Issue 7 | 1996 | AI | |
| A Case Study in Building Layered DHT Applications | Y. Chawathe, S. Ramabhadran, S. Ratnasamy, A. LaMarca, S. Shenker, J. Hellerstein | Proceedings of ACM Special Interest Group on Data Communications Conference (SIGCOMM 2005), Philadelphia, Pennsylvania, pp. 97-108 | August 2005 | Networking | [PDF]
|
| A Case for FAME: FPGA Architecture Model Execution | Z. Tan, A. Waterman, H. Cook, S. Bird, K. Asanović, and D. Patterson | Proceedings of the 37th International Symposium on Computer Architecture (ISCA 2010), Saint-Malo, France, pp. 290-301 | June 2010 | Architecture | [PDF]
|
| A Can of RASTA Worms | H. Hermansky and N. Morgan | Proceedings of the Speech Research Symposium XIII, Johns Hopkins University, Balitmore, Maryland, pp. 343-350 | 1993 | Speech | |
| A Brief History of the Association for Women in Mathematics: The Presidents' Perspectives | L. Blum | ICSI Technical Report TR-91-037 | June 1991 | ICSI Technical Reports | [PDF]
|
| A Brief History of Scanning | M. Allman, V. Paxson, and J. Terrell | Proceedings of ACM SIGCOMM Conference on Internet Measurement, San Diego, California, pp. 77-82 | October 2007 | Networking | [PDF]
|
| A Branch and Cut Algorithm for the Optimal Solution of the Side Chain Placement Problem | E. Althaus, O. Kohlbacher, H.P. Lenhof, and P. Muller | Technical Report Vol.2000-1-001, Max-Planck-Institut fur Informatik: Foschungsbericht, 2000. | 2000 | Algorithms | |
| A Biological Grounding of Recruitment Learning and Vicinal Algorithms | L. Shastri | ICSI Technical Report TR-99-009 | April 1999 | ICSI Technical Reports | [PDF]
|
| A BGP-Based Mechanism for Lowest-Cost Routing | J. Feigenbaum, C.H. Papadimitriou, R. Sami, and S. Shenker | Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), Monterey, California, pp. 173-182. | July 2002 | Networking | [PDF]
|
| A Best-Fit Approach to Productive Omission of Arguments | E. Mok and J. Bryant | The 32nd Annual Meeting of the Berkeley Linguistics Society, Berkeley, California | February 2006 | AI | [PDF]
|
| A 1.5-Approximation Algorithm for Sorting by Transpositions and Transversals | T. Hartman and R. Sharan | Proceedings of WABI | September 05 2004 | Algorithms | |
| A (Somewhat) New Solution to the Binding Problem | L. Barrett, J. Feldman, and L. M. Dermed | ICSI Technical Report TR-06-001 | May 2006 | ICSI Technical Reports | [PDF]
|
| A (Somewhat) New Solution to the Binding Problem | L. Barrett, J. Feldman, and L. Mac Dermed | Neural Computation, Vol. 20, Issue 9, pp. 2361-2378 (previously published as ICSI Technical Report in 2006) | September 2008 | AI | [PDF]
|
| @spam: The Underground on 140 Characters or Less | C. Grier, K. Thomas, V. Paxson, and M. Zhang | Proceedings of the 17th ACM Conference on Computer and Communications Security, Chicago, Illinois, pp. 27-37 | October 2010 | Networking | [PDF]
|
| 1.757 and 1.267-Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems | M. Karpinski and A. Zelikovsky | ICSI Technical Report TR-95-010 | March 1995 | ICSI Technical Reports | [PDF]
|
| "My Child Will be Respected": Parental Perspectives on Computers in Rural India | J. Pal, M. Lakshmanan, and K. Toyama | Proceedings of International Conference on Information Technologies and Development (ICTD2007), IEEE Computer Society/ACM, Bangalore, India, pp. 168-176 | December 2007 | BCIS (archived) | [PDF]
|
| "It Wont't Happen to Me!": Self-Disclosure in Online Social Networks | H. Krasnova, E. Kolesnikova, and O. Günther | Proceedings of the 15th Americas Conference on Information Systems (AMCIS 2009), San Francisco, California, paper 343 | August 2009 | Other | [PDF]
|
| "Eigenlips" for Robust Speech Recognition | C. Bregler and Y. Konig | ICSI Technical Report TR-94-002 | January 1994 | ICSI Technical Reports | [PDF]
|
| "Corpus linguistics" vs. "computer-aided armchair linguistics" | C.J. Fillmore | Directions in Corpus Linguistics: Proceedings from a 1991 Nobel Symposium on Corpus Linguistics. Stockholm: Mouton de Gruyter, pp. 35-66 | 1991 | AI | |
