Publications

Search
Export 20 results:
Author Title Type [ Year(Asc)]
Filters: Keyword is computational complexity  [Clear All Filters]
2011
Chellappa R, Cavallaro A, Wu Y, Shan C, Fu Y, Pulli K.  2011.  Special Issue on Video Analysis on Resource-Limited Systems. IEEE Transactions on Circuits and Systems for Video Technology. 21(10):1349-1352.
2010
Haeupler B, Saha B, Srinivasan A.  2010.  New Constructive Aspects of the Lovasz Local Lemma. 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS). :397-406.
2009
Yuan X, Cohen MB, Memon AM.  2009.  Towards Dynamic Adaptive Automated Test Generation for Graphical User Interfaces. Software Testing, Verification and Validation Workshops, 2009. ICSTW '09. International Conference on. :263-266.
2008
Deshpande A, Hellerstein L.  2008.  Flow Algorithms for Parallel Query Optimization. IEEE 24th International Conference on Data Engineering, 2008. ICDE 2008. :754-763.
2005
Demaine ED, Hajiaghayi MT, Kawarabayashi K.  2005.  Algorithmic graph minor theory: Decomposition, approximation, and coloring. Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on. :637-646.
Kianzad V, Bhattacharyya SS, Qu G.  2005.  CASPER: an integrated energy-driven approach for task graph scheduling on distributed embedded systems. Application-Specific Systems, Architecture Processors, 2005. ASAP 2005. 16th IEEE International Conference on. :191-197.
2002
Gandhi R, Khuller S, Parthasarathy S, Srinivasan A.  2002.  Dependent rounding in bipartite graphs. The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. :323-332.
1999
Ren J, Cukier M, Rubel P, Sanders WH, Bakken DE, Karr DA.  1999.  Building dependable distributed applications using AQUA. :189-196.
1997
Dancik V, Hannenhalli S, Muthukrishnan S.  1997.  Hardness of flip-cut problems from optical mapping [DNA molecules application]. Compression and Complexity of Sequences 1997. Proceedings. :275-284.
Srinivasan A.  1997.  Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. , 38th Annual Symposium on Foundations of Computer Science, 1997. Proceedings. :416-425.
1996
Bhat G, Cleaveland R.  1996.  Efficient model checking via the equational μ-calculus. , Eleventh Annual IEEE Symposium on Logic in Computer Science, 1996. LICS '96. Proceedings. :304-312.
1995
Bhat G, Cleaveland R, Grumberg O.  1995.  Efficient on-the-fly model checking for CTL. , Tenth Annual IEEE Symposium on Logic in Computer Science, 1995. LICS '95. Proceedings. :388-397.
Naor M, Schulman LJ, Srinivasan A.  1995.  Splitters and near-optimal derandomization. , 36th Annual Symposium on Foundations of Computer Science, 1995. Proceedings. :182-191.
1994
Srinivasan A, Zuckerman D.  1994.  Computing with very weak random sources. , 35th Annual Symposium on Foundations of Computer Science, 1994 Proceedings. :264-275.
Borah M, Bajwa RS, Hannenhalli S, Irwin MJ.  1994.  A SIMD solution to the sequence comparison problem on the MGAP. International Conference on Application Specific Array Processors, 1994. Proceedings. :336-345.
1993
Hannenhalli S, Perumalla K, Chandrasekharan N, Sridhar R.  1993.  A distributed algorithm for ear decomposition. , Fifth International Conference on Computing and Information, 1993. Proceedings ICCI '93. :180-184.
1992
Greenberg R, JaJa JF, Krishnamurthy S.  1992.  On the difficulty of Manhattan channel routing. Information Processing Letters. 44(5):281-284.
Chandrasekharan N, Hannenhalli S.  1992.  Efficient algorithms for computing matching and chromatic polynomials on series-parallel graphs. , Fourth International Conference on Computing and Information, 1992. Proceedings. ICCI '92. :42-45.
1991
Gil J, Matias Y, Vishkin U.  1991.  Towards a theory of nearly constant time parallel algorithms. Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on. :698-710.