Cookies?
Library Header Image
LSE Research Online LSE Library Services

Items where Author is "Sorkin, Gregory B."

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 69.

Article

Coja-Oghlan, Amin, Loick, Philipp, Mezei, Balazs F. and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2022) The ising antiferromagnet and max cut on random regular graphs. SIAM Journal on Discrete Mathematics. ISSN 0895-4801 (In Press)

Janson, Svante and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2021) Successive minimum spanning trees. Random Structures & Algorithms. ISSN 1042-9832

Frieze, Alan, Pegden, Wesley, Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 and Tkocz, Tomasz (2021) Minimum-weight combinatorial structures under random cost-constraints. Electronic Journal of Combinatorics, 28 (1). ISSN 1077-8926

Frieze, Alan, Pegden, Wesley and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2018) The distribution of minimum-weight cliques and other subgraphs in graphs with random edge weights. SIAM Journal on Discrete Mathematics, 32 (3). pp. 2115-2133. ISSN 0895-4801

Gaspers, Serge and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2017) Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets. ACM Transactions on Algorithms, 13 (4). pp. 1-36. ISSN 1549-6325

Frieze, Alan and Sorkin, Gregory B. (2015) Efficient algorithms for three-dimensional axial and planar random assignment problems. Random Structures & Algorithms, 46 (1). 160 - 196. ISSN 1042-9832

Galvin, David, Kahn, Jeff, Randall, Dana and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2015) Phase coexistence and torpid mixing in the 3-coloring model on Z^d. SIAM Journal on Discrete Mathematics, 29 (3). pp. 1223-1244. ISSN 0895-4801

Pittel, Boris and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2015) The satisfiability threshold for k-XORSAT. Combinatorics, Probability and Computing, 25 (2). pp. 236-268. ISSN 0963-5483

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 & Algorithms, 38 (3). pp. 350-364. ISSN 1042-9832

Gaspers, Serge and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (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. ORCID: 0000-0003-4935-7820 (2009) Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function. ACM Transactions on Algorithms, 5 (4). 45:1-27. ISSN 1549-6325

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

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. ORCID: 0000-0003-4935-7820 (2007) Random 2-SAT with prescribed literal degrees. Algorithmica, 48 (3). pp. 249-265. ISSN 0178-4617

Frieze, Alan and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2006) The probabilistic relationship between the assignment and travelling salesman problems. SIAM Journal on Computing, 36 (5). pp. 1435-1452. ISSN 0097-5397

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 & Algorithms, 27 (3). pp. 277-289. ISSN 1042-9832

Arratia, Richard, Bollobás, Béla and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2004) The interlace polynomial of a graph. Journal of Combinatorial Theory, Series B, 92 (2). pp. 199-233. ISSN 0095-8956

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

Flaxman, Abraham, Harrow, Aram W. and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (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. ORCID: 0000-0003-4935-7820 (2004) Random MAX SAT, random MAX CUT, and their phase transitions. Random Structures & Algorithms, 24 (4). pp. 502-545. ISSN 1042-9832

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

Arratia, Richard, Bollobás, Béla, Coppersmith, Don and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2000) Euler circuits and DNA sequencing by hybridization. Discrete Applied Mathematics, 104 (1-3). pp. 63-96. ISSN 0166-218X

Trevisan, Luca, Sorkin, Gregory B. ORCID: 0000-0003-4935-7820, 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. ORCID: 0000-0003-4935-7820 (1999) Constructive bounds and exact expectations for the random assignment problem. Random Structures & Algorithms, 15 (2). pp. 113-144. ISSN 1042-9832

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

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. ORCID: 0000-0003-4935-7820, Chess, David M. and White, Steve R. (1997) Fighting computer viruses. Scientific American, 277 (5). pp. 88-93. ISSN 0036-8733

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

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

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

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

Book Section

Gaspers, Serge and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2015) Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets. In: Halldórsson, Magnús M., Iwama, Kazuo, Kobayashi, Naoki and Speckmann, Bettina, (eds.) Automata, Languages, and Programming: 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part I. Lecture Notes in Computer Science. Springer, pp. 567-579. ISBN 9783662476710

Chebolu, Prasad, Frieze, Alan, Melsted, Páll and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (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. 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. (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. ORCID: 0000-0003-4935-7820 (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

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

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

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 Approxima. Lecture notes in computer science (2764). Springer, pp. 382-395. ISBN 9783540407706

Coppersmith, Don, Gamarnik, David, Hajiaghayi, Mohammad and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (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

Coppersmith, Don and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (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

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, Octo. Lecture notes in computer science (1518). Springer, pp. 319-330. ISBN 9783540651420

Kephart, Jeffrey O., Sorkin, Gregory B. ORCID: 0000-0003-4935-7820, 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

Kephart, Jeffrey O., Sorkin, Gregory B. ORCID: 0000-0003-4935-7820, 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. ORCID: 0000-0003-4935-7820 (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. ORCID: 0000-0003-4935-7820 (1995) Simulated annealing. In: Arbib, Michael A., (ed.) Handbook of Brain Theory and Neural Networks. MIT Press, pp. 876-879. ISBN 9780262011488

Solla, Sara A., Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 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. Springer, pp. 283-292. ISBN 9780387160948

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

Conference or Workshop Item

Janson, Svante and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2019) Successive minimum spanning trees. In: International Conference on Randomization and Computation (Random) 2019, 2019-09-20 - 2019-09-22, MIT Stata Center, Cambridge, United States.

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

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, 2009-01-04 - 2009-01-06.

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, 2002-01-06 - 2002-01-08.

Frieze, Alan and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2001) The probabilistic relationship between the assignment and traveling salesman problems. In: Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, 2001-01-07 - 2001-01-09.

Achioptas, D. and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (2000) Optimal myopic algorithms for random 3-SAT. In: 41st Annual Symposium on Foundations of Computer Science, 2000-11-12 - 2000-11-14, Redondo Beach, United States.

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, 2000-01-09 - 2000-01-11.

Kephart, Jeffrey O., Sorkin, Gregory B. ORCID: 0000-0003-4935-7820, Swimmer, Morton and White, Steve R. (1997) Blueprint for a computer immune system. In: The Seventh International Virus Bulletin Conference, 1997-10-02 - 1997-10-03, CA, United States.

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', 1997-10-12 - 1997-10-15.

Trevisan, Luca, Sorkin, Gregory B. ORCID: 0000-0003-4935-7820, Sudan, Madhu and Williamson, David P. (1996) Gadgets, approximation, and linear programming. In: 37th Annual IEEE Symposium on Foundations of Computer Science, 1996-10-14 - 1996-10-16, VT, United States.

Arnold, William C. and Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (1996) Automated analysis of computer viruses. In: 1996 Virus Bulletin International Conference, 1996-09-19 - 1996-09-20.

Kephart, Jeffrey O., Sorkin, Gregory B. ORCID: 0000-0003-4935-7820, 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, 1995-08-20 - 1995-08-25, Quebec, Canada.

Jerrum, Mark and Sorkin, Gregory B. (1993) Simulated annealing for graph bisection. In: 34th Annual Symposium on Foundations of Computer Science, 1993-11-03 - 1993-11-05.

Sorkin, Gregory B. ORCID: 0000-0003-4935-7820 (1990) Simulated annealing on fractals: theoretical analysis and relevance for combinatorial optimization. In: The sixth MIT conference on advanced research in VLSI, 1990-04-02 - 1990-04-04, MA, United States.

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

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, 1987-01-01.

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

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, 1982-06-14 - 1982-06-16.

This list was generated on Sun Jan 23 08:59:46 2022 GMT.