Publications
Export 20 results:
Author Title Type [ Year] Filters: Keyword is computational complexity [Clear All Filters]
2011. Special Issue on Video Analysis on Resource-Limited Systems. IEEE Transactions on Circuits and Systems for Video Technology. 21(10):1349-1352.
2010. New Constructive Aspects of the Lovasz Local Lemma. 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS). :397-406.
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. Flow Algorithms for Parallel Query Optimization. IEEE 24th International Conference on Data Engineering, 2008. ICDE 2008. :754-763.
2005. Algorithmic graph minor theory: Decomposition, approximation, and coloring. Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on. :637-646.
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.
2004. A Rank-by-Feature Framework for Unsupervised Multidimensional Data Exploration Using Low Dimensional Projections. IEEE Symposium on Information Visualization, 2004. INFOVIS 2004. :65-72.
2002. Dependent rounding in bipartite graphs. The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. :323-332.
1997. Hardness of flip-cut problems from optical mapping [DNA molecules application]. Compression and Complexity of Sequences 1997. Proceedings. :275-284.
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. Efficient model checking via the equational μ-calculus. , Eleventh Annual IEEE Symposium on Logic in Computer Science, 1996. LICS '96. Proceedings. :304-312.
1995. Efficient on-the-fly model checking for CTL. , Tenth Annual IEEE Symposium on Logic in Computer Science, 1995. LICS '95. Proceedings. :388-397.
1995. Splitters and near-optimal derandomization. , 36th Annual Symposium on Foundations of Computer Science, 1995. Proceedings. :182-191.
1994. Computing with very weak random sources. , 35th Annual Symposium on Foundations of Computer Science, 1994 Proceedings. :264-275.
1994. A SIMD solution to the sequence comparison problem on the MGAP. International Conference on Application Specific Array Processors, 1994. Proceedings. :336-345.
1993. A distributed algorithm for ear decomposition. , Fifth International Conference on Computing and Information, 1993. Proceedings ICCI '93. :180-184.
1992. On the difficulty of Manhattan channel routing. Information Processing Letters. 44(5):281-284.
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. Towards a theory of nearly constant time parallel algorithms. Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on. :698-710.