Surprises For Your Loved Ones
Placeholder Substructures: The Road from NKS to Small-World, Scale-Free Networks is Paved with Zero-Divisors (and a New Kind of Number Theory) Robert de.
Matroids
Important Cuts and (p,q)-clustering
DetectionOfCompoundStructuresUsingHierarchicalClusteringOfStatisticalAndStructuralFeatures.pdf
Hymns of the Eastern Church
© 2006 Carnegie Mellon University Combining Predicate and Numeric Abstraction for Software Model Checking Software Engineering Institute Carnegie Mellon.
Nonlinear methods in discrete optimization László Lovász Eötvös Loránd University, Budapest [email protected].
By Groysman Maxim. Let S be a set of sites in the plane. Each point in the plane is influenced by each point of S. We would like to decompose the plane.
1 Online and Stochastic Survivable Network Design Ravishankar Krishnaswamy Carnegie Mellon University joint work with Anupam Gupta and R. Ravi.
BFS and DFS BFS and DFS in directed graphs BFS in undirected graphs An improved undirected BFS-algorithm.
Research Focus Textual Inference and Knowledge Representation Our research focuses on the computational foundations of intelligent behavior. We develop.
