Items where Author is "Sorkin, Gregory B."

Number of items: 73.
  • Applying harmonic balance to almost-periodic circuits. Kundert, K.S. and Sorkin, Gregory B. and Sangiovanni-Vincentelli, A.
  • Asymptotically perfect trivial global routing: a stochastic analysis. Sorkin, Gregory B.
  • Automated analysis of computer viruses. Arnold, William C. and Sorkin, Gregory B.
  • Average-case analyses of Vickrey costs. Chebolu, Prasad and Frieze, Alan and Melsted, Páll and Sorkin, Gregory B.
  • Belief Propagation guided decimation on random 1 k-XORSAT. Chatterjee, Arnab and Coja-oghlan, Amin and Kang, Mihyun and Krieg, Lena and Rolvien, Maurice and Sorkin, Gregory B. picture_as_pdf
  • Biologically inspired defenses against computer viruses. Kephart, Jeffrey O. and Sorkin, Gregory B. and Arnold, William C. and Chess, David M. and Tesauro, Gerald J. and White, Steve R.
  • Biologically inspired defenses against computer viruses. Kephart, Jeffrey O. and Sorkin, Gregory B. and Arnold, William C. and Chess, David M. and Tesauro, Gerald J. and White, Steve R.
  • Blueprint for a computer immune system. Kephart, Jeffrey O. and Sorkin, Gregory B. and Swimmer, Morton and White, Steve R.
  • Blueprint for a computer immune system. Kephart, Jeffrey O. and Sorkin, Gregory B. and Swimmer, Morton and White, Steve R.
  • Building Hamiltonian cycles in the semi-random graph process in less than 2 rounds. Frieze, Alan and Gao, Pu and MacRury, Calum and Pralat, Pawel and Sorkin, Gregory B. picture_as_pdf
  • Conditional probability tree estimation analysis and algorithms. Beygelzimer, Alina and Langford, John and Lifshits, Yuri and Sorkin, Gregory B. and Strehl, Alex
  • Configuration space analysis for optimization problems. Solla, Sara A. and Sorkin, Gregory B. and White, Steve R.
  • Constructing computer virus phylogenies. Goldberg, Leslie A. and Goldberg, Paul W. and Phillips, Cynthia A. and Sorkin, Gregory B.
  • Constructing computer virus phylogenies. Goldberg, Leslie A. and Goldberg, Paul W. and Phillips, Cynthia A. and Sorkin, Gregory B.
  • Constructive bounds and exact expectations for the random assignment problem. Coppersmith, Don and Sorkin, Gregory B.
  • Constructive bounds and exact expectations for the random assignment problem. Coppersmith, Don and Sorkin, Gregory B.
  • Efficient algorithms for three-dimensional axial and planar random assignment problems. Frieze, Alan and Sorkin, Gregory B.
  • Efficient simulated annealing on fractal energy landscapes. Sorkin, Gregory B.
  • Embracing the giant component. Flaxman, Abraham and Gamarnik, David and Sorkin, Gregory B.
  • Embracing the giant component. Flaxman, Abraham D. and Gamarnik, David and Sorkin, Gregory B.
  • Euler circuits and DNA sequencing by hybridization. Arratia, Richard and Bollobás, Béla and Coppersmith, Don and Sorkin, Gregory B.
  • Exact expectations and distributions for the random assignment problem. Alm, Erik. S and Sorkin, Gregory B.
  • Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances. Scott, Alexander D. and Sorkin, Gregory B.
  • Fighting computer viruses. Kephart, Jeffrey O. and Sorkin, Gregory B. and Chess, David M. and White, Steve R.
  • First-passage percolation on a ladder graph, and the path cost in a VCG auction. Flaxman, Abraham and Gamarnik, David and Sorkin, Gregory B.
  • First-passage percolation on a width-2 strip and the path cost in a VCG auction. Flaxman, Abraham and Gamarnik, David and Sorkin, Gregory B.
  • Gadgets, approximation, and linear programming. Trevisan, Luca and Sorkin, Gregory B. and Sudan, Madhu and Williamson, David P.
  • Gadgets, approximation, and linear programming. Trevisan, Luca and Sorkin, Gregory B. and Sudan, Madhu and Williamson, David P.
  • An LP-designed algorithm for constraint satisfaction. Scott, Alexander D. and Sorkin, Gregory B.
  • Linear-programming design and analysis of fast algorithms for Max 2-CSP. Scott, Alexander D. and Sorkin, Gregory B.
  • The Metropolis algorithm for graph bisection. Jerrum, Mark and Sorkin, Gregory B.
  • Minimum-weight combinatorial structures under random cost-constraints. Frieze, Alan and Pegden, Wesley and Sorkin, Gregory B. and Tkocz, Tomasz picture_as_pdf
  • Neural networks for computer virus recognition. Tesauro, G.J. and Kephart, J.O. and Sorkin, Gregory B.
  • ORCA: a sea-of-gates place and route system. Beardslee, Mark and Igusa, Mitch and Kramer, Alan and Sharma, Amit and Sorkin, Gregory B.
  • On the expected incremental cost of a minimum assignment. Coppersmith, Don and Sorkin, Gregory B.
  • Optimal myopic algorithms for random 3-SAT. Achioptas, D. and Sorkin, Gregory B.
  • Perfect matchings and loose Hamilton cycles in the semirandom hypergraph model. Molloy, Michael and Pralat, Pawel and Sorkin, Gregory B. picture_as_pdf
  • Phase coexistence and torpid mixing in the 3-coloring model on Z^d. Galvin, David and Kahn, Jeff and Randall, Dana and Sorkin, Gregory B.
  • Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function. Scott, Alexander D. and Sorkin, Gregory B.
  • Random 2-SAT with prescribed literal degrees. Cooper, Colin and Frieze, Alan and Sorkin, Gregory B.
  • Random MAX SAT, random MAX CUT, and their phase transitions. Coppersmith, Don and Gamarnik, David and Taghi Hajiaghayi, Mohammad and Sorkin, Gregory B.
  • Random Max Sat, random Max Cut, and their phase transitions. Coppersmith, Don and Gamarnik, David and Hajiaghayi, Mohammad and Sorkin, Gregory B.
  • Robust reductions from ranking to classification. Balcan, Maria Florina and Bansal, Nikhil and Beygelzimer, Alina and Coppersmith, Don and Langford, John and Sorkin, Gregory B.
  • Robust reductions from ranking to classification. Balcan, Maria-Florina and Bansal, Nikhil and Beygelzimer, Alina and Coppersmith, Don and Langford, John and Sorkin, Gregory B.
  • Separate, measure and conquer:faster polynomial-space algorithms for Max 2-CSP and counting dominating sets. Gaspers, Serge and Sorkin, Gregory B.
  • Separate, measure and conquer:faster polynomial-space algorithms for Max 2-CSP and counting dominating sets. Gaspers, Serge and Sorkin, Gregory B.
  • Simulated annealing. Kirkpatrick, Scott and Sorkin, Gregory B.
  • Simulated annealing for graph bisection. Jerrum, Mark and Sorkin, Gregory B.
  • Simulated annealing on fractals: theoretical analysis and relevance for combinatorial optimization. Sorkin, Gregory B.
  • Snakes and ladders and intransitivity, or what mathematicians do in their time off. Sorkin, Gregory B. picture_as_pdf
  • Solving sparse random instances of Max Cut and Max 2-CSP in linear expected time. Scott, Alexander D. and Sorkin, Gregory B.
  • Some notes on random satisfiability. Sorkin, Gregory B.
  • Strings with maximally many distinct subsequences and substrings. Flaxman, Abraham and Harrow, Aram W. and Sorkin, Gregory B.
  • Successive minimum spanning trees. Janson, Svante and Sorkin, Gregory B. picture_as_pdf
  • Successive minimum spanning trees. Janson, Svante and Sorkin, Gregory B. picture_as_pdf
  • Trivial global wiring of large chips: a statistical analysis. Sorkin, Gregory B.
  • Vehicle routing and staffing for sedan service. Günlük, Oktay and Kimbrel, Tracy and Ladanyi, Laszlo and Schieber, Baruch and Sorkin, Gregory B.
  • An almost-periodic Fourier transform for use with harmonic balance. Sorkin, Gregory B. and Kundert, Kenneth S. and Sangiovanni-Vincentelli, Alberto
  • The distribution of minimum-weight cliques and other subgraphs in graphs with random edge weights. Frieze, Alan and Pegden, Wesley and Sorkin, Gregory B.
  • The enumeration of nonhomeomorphic graphs by edges. Sorkin, Gregory B.
  • An immune system for cyberspace. Kephart, Jeffrey O. and Sorkin, Gregory B. and Swimmer, Morton
  • The interlace polynomial of a graph. Arratia, Richard and Bollobás, Béla and Sorkin, Gregory B.
  • The interlace polynomial: a new graph polynomial. Arratia, Richard and Bollobás, Béla and Sorkin, Gregory B.
  • The ising antiferromagnet and max cut on random regular graphs. Coja-Oghlan, Amin and Loick, Philipp and Mezei, Balazs F. and Sorkin, Gregory B. picture_as_pdf
  • A note on random 2-SAT with prescribed literal degrees. Cooper, Colin and Frieze, Alan and Sorkin, Gregory B.
  • The planar package planner for system designers. Heller, William R. and Sorkin, Gregory B. and Maling, Klim
  • The probabilistic relationship between the assignment and traveling salesman problems. Frieze, Alan and Sorkin, Gregory B.
  • The probabilistic relationship between the assignment and travelling salesman problems. Frieze, Alan and Sorkin, Gregory B.
  • The satisfiability threshold for k-XORSAT. Pittel, Boris and Sorkin, Gregory B.
  • A tight bound on the collection of edges in MSTs of induced subgraphs. Sorkin, Gregory B. and Steger, Angelika and Zenklusenc, Rico
  • A two-variable interlace polynomial. Arratia, Richard and Bollobás, Béla and Sorkin, Gregory B.
  • A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. Gaspers, Serge and Sorkin, Gregory B.
  • A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. Gaspers, Serge and Sorkin, Gregory B.