"Sorkin, Gregory B."

Flaxman, Abraham, Gamarnik, David and Sorkin, Gregory B. (2011) First-passage percolation on a ladder graph, and the path cost in a VCG auction. Random structures and algorithms, 38 (3). pp. 350-364. ISSN 1042-9832

Gaspers , Serge and Sorkin, Gregory B. (2011) A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. Journal of computer and system sciences, 78 (1). pp. 305-335. ISSN 0022-0000

Scott, Alexander D. and Sorkin, Gregory B. (2009) Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function. ACM transactions on Algorithms, 5 (4). 45:1-27. ISSN 1549-6325

Beygelzimer, Alina , Langford, John , Lifshits, Yuri , Sorkin, Gregory B. and Strehl, Alex (2009) Conditional probability tree estimation analysis and algorithms. In: Uncertainty in artificial intelligence , 18-21 June 2009, Montreal, QC, Canada.

Sorkin, Gregory B. , Steger, Angelika and Zenklusenc, Rico (2009) A tight bound on the collection of edges in MSTs of induced subgraphs. Journal of combinatorial theory, series B, 99 (2). pp. 428-435. ISSN 0095-8956

Gaspers , Serge and Sorkin, Gregory B. (2009) A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. In: ACM-SIAM Symposium 4-6 January hosted in New York Marriot Downtown, NY, 4-6 January, 2009, New York Marriot Downtown, NY.

Chebolu, Prasad , Frieze, Alan , Melsted, Páll and Sorkin, Gregory B. (2009) Average-case analyses of Vickrey costs. In: Dinur, Irit , Jansen, Klaus , Naor, Seffi and Rolim, José , (eds.) Approximation, randomization, and combinatorial optimization. Algorithms and techniques:12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21-23, 2009, Proceedings. Lecture notes in computer science (5687). Springer, pp. 434-447. ISBN 9783642036842

Balcan, Maria-Florina, Bansal, Nikhil, Beygelzimer, Alina , Coppersmith, Don , Langford, John and Sorkin, Gregory B. (2008) Robust reductions from ranking to classification. Machine learning, 72 (1-2). pp. 139-153. ISSN 0885-6125

Scott, Alexander D. and Sorkin, Gregory B. (2007) Linear-programming design and analysis of fast algorithms for Max 2-CSP. Discrete optimization, 4 (3-4). pp. 260-287. ISSN 1572-5286

Cooper, Colin , Frieze, Alan and Sorkin, Gregory B. (2007) Random 2-SAT with prescribed literal degrees. Algorithmica , 48 (3). pp. 249-265. ISSN 0178-4617

Balcan, Maria Florina , Bansal, Nikhil , Beygelzimer, Alina , Coppersmith, Don , Langford, John and Sorkin, Gregory B. (2007) Robust reductions from ranking to classification. In: Bshouty, Nader and Gentile , Claudio , (eds.) Learning theory: 20th Annual Conference on Learning Theory, COLT 2007, San Diego, CA, USA, June 13-15, 2007, Proceedings. Lecture notes in computer science (4539). Springer, Germany, pp. 604-619. ISBN 9783540729259

Flaxman, Abraham , Gamarnik, David and Sorkin, Gregory B. (2006) First-passage percolation on a width-2 strip and the path cost in a VCG auction. In: Spirakis, Paul, Mavronicolas, Marios and Kontogiannis, Spyros , (eds.) Internet and network economics: Second International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006, Proceedings. Lecture notes in computer science (4286). Springer , pp. 99-111. ISBN 9783540681380

Frieze, Alan and Sorkin, Gregory B. (2006) The probabilistic relationship between the assignment and travelling salesman problems. Siam journal on computing, 36 (5). pp. 1435-1452. ISSN 0097-5397

Scott , Alexander D. and Sorkin, Gregory B. (2006) An LP-designed algorithm for constraint satisfaction. In: Azar, Yossi and Erlebach, Thomas , (eds.) Algorithms - ESA 2006. 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings. Lecture notes in computer science (4168). Springer, pp. 588-599. ISBN 9783540388753

Günlük, Oktay, Kimbrel, Tracy , Ladanyi, Laszlo, Schieber, Baruch and Sorkin, Gregory B. (2006) Vehicle routing and staffing for sedan service. Transportation science, 40 (3). pp. 313-326. ISSN 0041-1655

Scott, Alexander D. and Sorkin, Gregory B. (2006) Solving sparse random instances of Max Cut and Max 2-CSP in linear expected time. Combinatorics, probability and computing, 15 (1-2). pp. 281-315. ISSN 0963-5483

Flaxman, Abraham D., Gamarnik, David and Sorkin, Gregory B. (2005) Embracing the giant component. Random structures and algorithms, 27 (3). pp. 277-289. ISSN 1042-9832

Arratia, Richard, Bollobás, Béla and Sorkin, Gregory B. (2004) The interlace polynomial of a graph. Journal of combinatorial theory, series B, 92 (2). pp. 199-233. ISSN 0095-8956

Flaxman, Abraham , Gamarnik, David and Sorkin, Gregory B. (2004) Embracing the giant component. In: Farach-Colton, Martin , (ed.) LATIN 2004: theoretical informatics. 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings. Lecture notes in computer science (2976). Springer , pp. 66-79. ISBN 9783540212584

Arratia, Richard , Bollobás, Béla and Sorkin, Gregory B. (2004) A two-variable interlace polynomial. Combinatorica, 24 (2). pp. 567-584. ISSN 0209-9683

Flaxman, Abraham , Harrow, Aram W. and Sorkin, Gregory B. (2004) Strings with maximally many distinct subsequences and substrings. Electronic journal of combinatorics , 11 (1). pp. 1-10. ISSN 1077-8926

Coppersmith, Don , Gamarnik, David , Taghi Hajiaghayi, Mohammad and Sorkin, Gregory B. (2004) Random MAX SAT, random MAX CUT, and their phase transitions. Random structures and algorithms, 24 (4). pp. 502-545. ISSN 1042-9832

Scott, Alexander D. and Sorkin, Gregory B. (2003) Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances. In: Arora, S., Jansen, K., Rolim, J.D.P. and Sahai, A., (eds.) Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approx. Lecture notes in computer science (2764). Springer, pp. 382-395. ISBN 9783540407706

Coppersmith, Don , Gamarnik, David , Hajiaghayi, Mohammad and Sorkin, Gregory B. (2003) Random Max Sat, random Max Cut, and their phase transitions. In: Farach-Colton, Martin , (ed.) Proceedings of the fourteenth Aanual ACM-SIAM: symposium on discrete algorithms. SIAM, pp. 364-373. ISBN 9780898715385

Alm , Erik. S and Sorkin, Gregory B. (2002) Exact expectations and distributions for the random assignment problem. Combinatorics, probability and computing, 11 (3). pp. 217-248. ISSN 0963-5483

Cooper, Colin, Frieze, Alan and Sorkin, Gregory B. (2002) A note on random 2-SAT with prescribed literal degrees. In: Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms , 6-8 January 2002, San Francisco, CA, USA.

Coppersmith, Don and Sorkin, Gregory B. (2002) On the expected incremental cost of a minimum assignment. In: Bollobás, Béla , (ed.) Contemporary combinatorics. Bolyai Society Mathematical Studies (10). Springer, pp. 277-288. ISBN 9783540427254

Sorkin, Gregory B. (2001) Some notes on random satisfiability. In: Steinhöfel , Kathleen , (ed.) Stochastic algorithms: foundations and applications: International Symposium, SAGA 2001, Germany, December 2001 Proceedings. Lecture notes in computer science (2264). Springer , pp. 117-130. ISBN 9783540430254

Frieze , Alan and Sorkin, Gregory B. (2001) The probabilistic relationship between the assignment and traveling salesman problems. In: Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms , 7-9 January 2001, Washington, DC, USA.

Achioptas, D. and Sorkin, Gregory B. (2000) Optimal myopic algorithms for random 3-SAT. In: 41st Annual Symposium on Foundations of Computer Science, 12-14 November 2000, Redondo Beach, USA.

Arratia, Richard, Bollobás , Béla , Coppersmith , Don and Sorkin, Gregory B. (2000) Euler circuits and DNA sequencing by hybridization. Discrete applied mathematics, 104 (1-3). pp. 63-96. ISSN 0166-218X

Arratia, Richard , Bollobás, Béla and Sorkin, Gregory B. (2000) The interlace polynomial: a new graph polynomial. In: Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms , 9-11 January 2000, San Francisco, California .

Trevisan, Luca , Sorkin, Gregory B. , Sudan, Madhu and Williamson, David P. (2000) Gadgets, approximation, and linear programming. Siam journal on computing, 29 (6). pp. 2074-2097. ISSN 0097-5397

Coppersmith , Don and Sorkin, Gregory B. (1999) Constructive bounds and exact expectations for the random assignment problem. Random structures and algorithms, 15 (2). pp. 113-144. ISSN 1042-9832

Coppersmith, Don and Sorkin, Gregory B. (1998) Constructive bounds and exact expectations for the random assignment problem. In: Luby, Michael, Rolim, Jose and Serna, Maria J. , (eds.) Randomization and approximation techniques in computer science: Second International Workshop, RANDOM'98, Barcelona, Spain, October 8-10, 1998. Lecture notes in computer science (1518). Springer, pp. 319-330. ISBN 9783540651420

Kephart, Jeffrey O. , Sorkin, Gregory B. , Swimmer, Morton and White, Steve R. (1998) Blueprint for a computer immune system. In: Dasgupta, Dipankar , (ed.) Artificial immune systems and their applications. Springer, Berlin , pp. 242-261. ISBN 9783540643906

Jerrum, Mark and Sorkin, Gregory B. (1998) The Metropolis algorithm for graph bisection. Discrete applied mathematics, 82 (1-3). pp. 155-175. ISSN 0166-218X

Kephart, Jeffrey O. , Sorkin, Gregory B. , Arnold, William C. , Chess, David M. , Tesauro, Gerald J. and White, Steve R. (1998) Biologically inspired defenses against computer viruses. In: Michalski, Ryszad S., Bratko, Ivan and Kubat, Miroslav , (eds.) Machine learning and data mining: methods and applications. John Wiley & Sons , pp. 313-334. ISBN 9780471971993

Goldberg, Leslie A., Goldberg, Paul W. , Phillips, Cynthia A. and Sorkin, Gregory B. (1998) Constructing computer virus phylogenies. Journal of algorithms, 26 (1). pp. 188-208. ISSN 0196-6774

Kephart, Jeffrey O., Sorkin, Gregory B. , Chess, David M. and White, Steve R. (1997) Fighting computer viruses. Scientific American, 277 (5). pp. 88-93. ISSN 0036-8733

Kephart, Jeffrey O. , Sorkin, Gregory B. , Swimmer, Morton and White, Steve R. (1997) Blueprint for a computer immune system. In: The Seventh International Virus Bulletin Conference, 2-3 October 1997, San Francisco, CA, USA.

Kephart, Jeffrey O. , Sorkin, Gregory B. and Swimmer, Morton (1997) An immune system for cyberspace. In: IEEE International Conference on Systems, Man, and Cybernetics 'Computational Cybernetics and Simulation', 12 -15 October 1997 , Orlando, Florida.

Trevisan, Luca , Sorkin, Gregory B. , Sudan, Madhu and Williamson, David P. (1996) Gadgets, approximation, and linear programming. In: 37th Annual IEEE Symposium on Foundations of Computer Science, 14-16 October 1996 , Burlington, VT, USA .

Arnold, William C. and Sorkin, Gregory B. (1996) Automated analysis of computer viruses. In: 1996 Virus Bulletin International Conference, 19-20 September 1996, Brighton, UK.

Tesauro, G.J., Kephart, J.O. and Sorkin, Gregory B. (1996) Neural networks for computer virus recognition. IEEE Expert , 11 (4). pp. 5-6. ISSN 0885-9000

Goldberg, Leslie A., Goldberg, Paul W. , Phillips, Cynthia A. and Sorkin, Gregory B. (1996) Constructing computer virus phylogenies. In: Hirschberg, Dan and Meyers, Gene, (eds.) Combinatorial pattern matching.7th Annual Symposium, CPM '96, Laguna Beach, California, June 10-12, 1996. Proceedings. Lecture Notes in Computer Science (1075 ). Springer, pp. 253-270. ISBN 9783540612582

Kirkpatrick, Scott and Sorkin, Gregory B. (1995) Simulated annealing. In: Arbib, Michael A., (ed.) Handbook of brain theory and neural networks. The MIT Press, pp. 876-879. ISBN 9780262011488

Kephart, Jeffrey O. , Sorkin, Gregory B. , Arnold, William C. , Chess, David M. , Tesauro, Gerald J. and White, Steve R. (1995) Biologically inspired defenses against computer viruses. In: The Fourteenth International Joint Conference on Artificial Intelligence, 20-25 August 1995 , Montreal, Quebec, Canada .

Jerrum, Mark and Sorkin, Gregory B. (1993) Simulated annealing for graph bisection. In: 34th Annual Symposium on Foundations of Computer Science , 3-5 November 1993 , Palo Alto, CA, USA .

Sorkin, Gregory B. (1991) Efficient simulated annealing on fractal energy landscapes. Algorithmica , 6 (1-6). pp. 367-418. ISSN 1432-0541

Sorkin, Gregory B. (1990) Simulated annealing on fractals: theoretical analysis and relevance for combinatorial optimization. In: The sixth MIT conference on advanced research in VLSI , 2-4 April 1990, MIT, Cambridge, MA, USA.

Kundert , K.S., Sorkin, Gregory B. and Sangiovanni-Vincentelli, A. (1988) Applying harmonic balance to almost-periodic circuits. IEEE transactions on Microwave theory and techniques , 36 (2). pp. 366-378. ISSN 0018-9480

Beardslee , Mark, Igusa, Mitch , Kramer, Alan , Sharma, Amit and Sorkin, Gregory B. (1988) ORCA: a sea-of-gates place and route system. In: International Workshop on Placement and Routing MCNC.

Sorkin, Gregory B. (1987) Asymptotically perfect trivial global routing: a stochastic analysis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 6 (5). pp. 820-827. ISSN 0278-0070

Sorkin, Gregory B. , Kundert, Kenneth S. and Sangiovanni-Vincentelli, Alberto (1987) An almost-periodic Fourier transform for use with harmonic balance. In: 1987 IEEE MTT-S International Microwave Symposium Digest.

Solla, Sara A. , Sorkin, Gregory B. and White, Stephen (1986) Configuration space analysis for optimization problems. In: Bienenstock, E. , (ed.) Disordered systems and biological organization. Nato ASI series. Series F: computer and systems sciences (20). Springer, pp. 283-292. ISBN 9780387160948

Sorkin, Gregory B. (1986) Trivial global wiring of large chips: a statistical analysis. In: IEEE International Conference on Computer-Aided Design (IEEE ICCAD).

Heller, William R. , Sorkin, Gregory B. and Maling, Klim (1982) The planar package planner for system designers. In: The 19th ACM/IEEE Conference on Design Automation , 14-16 June 1982.

Sorkin, Gregory B. (1980) The enumeration of nonhomeomorphic graphs by edges. In: Hammer, Peter L. , (ed.) Combinatorics 79. Annals of Discrete Mathematics (9). Elsevier B.V. , pp. 249-252. ISBN 9780444861115