Gabow, Harold: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

51

Finding All Spanning Trees of Directed and Undirected Graphs

Gabow, Harold N., Myers, Eugene W.

Journal:

SIAM Journal on Computing

Year:

1978

Language:

english

File:

PDF, 876 KB

english, 1978

52

A Model for Minimizing Active Processor Time

Jessica Chang, Harold N. Gabow, Samir Khuller

Journal:

Year:

2014

Language:

english

File:

PDF, 1.08 MB

english, 2014

53

[ACM Press the fifteenth annual ACM symposium - Not Known (1983..-..)] Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 - An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems

Gabow, Harold N.

Year:

1983

Language:

english

File:

PDF, 820 KB

english, 1983

54

[IEEE 17th Annual Symposium on Foundations of Computer Science (sfcs 1976) - Houston, TX, USA (1976.10.25-1976.10.27)] 17th Annual Symposium on Foundations of Computer Science (sfcs 1976) - Using computer trees to derive lower bounds for selection problems

Fussenegger, Frank, Gabow, Harold N.

Year:

1976

Language:

english

File:

PDF, 531 KB

english, 1976

55

[IEEE 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA, USA (2013.10.26-2013.10.29)] 2013 IEEE 54th Annual Symposium on Foundations of Computer Science - Algebraic Algorithms for B-Matching, Shortest Undirected Paths, and F-Factors

Gabow, Harold N., Sankowski, Piotr

Year:

2013

Language:

english

File:

PDF, 342 KB

english, 2013

56

[IEEE 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) - Tucson, AZ, USA (1983.11.7-1983.11.9)] 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) - Scaling algorithms for network problems

Gabow, Harold N.

Year:

1983

Language:

english

File:

PDF, 1.47 MB

english, 1983

57

An Ear Decomposition Approach to Approximating the Smallest 3-Edge Connected Spanning Subgraph of a Multigraph

Gabow, Harold N.

Journal:

SIAM Journal on Discrete Mathematics

Year:

2004

Language:

english

File:

PDF, 256 KB

english, 2004

58

[IEEE 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) - San Juan, Puerto Rico (1979.10.29-1979.10.31)] 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) - Efficient algorithms for simple matroid intersection problems

Gabow, Harold N., Tarjan, Robert E.

Year:

1979

Language:

english

File:

PDF, 1.05 MB

english, 1979

59

[IEEE 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS) - New Brunswick, NJ, USA (2012.10.20-2012.10.23)] 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science - Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings

Cygan, Marek, Gabow, Harold N., Sankowski, Piotr

Year:

2012

Language:

english

File:

PDF, 284 KB

english, 2012

60

COLORING ALGORITHMS ON SUBCUBIC GRAPHS

SKULRATTANAKULCHAI, SAN, GABOW, HAROLD N.

Journal:

International Journal of Foundations of Computer Science

Year:

2004

Language:

english

File:

PDF, 1.20 MB

english, 2004

61

Using expander graphs to find vertex connectivity

Gabow, Harold N.

Journal:

Journal of the ACM

Year:

2006

Language:

english

File:

PDF, 553 KB

english, 2006

62

Efficient implementation of graph algorithms using contraction

Gabow, Harold N., Galil, Zvi, Spencer, Thomas H.

Journal:

Journal of the ACM

Year:

1989

Language:

english

File:

PDF, 2.97 MB

english, 1989

63

[ACM Press the thirty-sixth annual ACM symposium - Chicago, IL, USA (2004.06.13-2004.06.16)] Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04 - Finding paths and cycles of superpolylogarithmic length

Gabow, Harold N.

Year:

2004

Language:

english

File:

PDF, 247 KB

english, 2004

64

Editor's foreword

Gabow, Harold N.

Journal:

ACM Transactions on Algorithms

Year:

2005

Language:

english

File:

PDF, 21 KB

english, 2005

65

Foreword to special issue on SODA 2007

Journal:

ACM Transactions on Algorithms

Year:

2009

File:

PDF, 24 KB

2009

66

[ACM Press the twentieth annual ACM symposium - Chicago, Illinois, United States (1988.05.02-1988.05.04)] Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 - Almost-optimum speed-ups of algorithms for bipartite matching and related problems

Gabow, Harold, Tarjan, Robert

Year:

1988

Language:

english

File:

PDF, 1.35 MB

english, 1988

67

[ACM Press the thirty-first annual ACM symposium - Atlanta, Georgia, United States (1999.05.01-1999.05.04)] Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99 - Unique maximum matching algorithms

Gabow, Harold N., Kaplan, Haim, Tarjan, Robert E.

Year:

1999

Language:

english

File:

PDF, 794 KB

english, 1999

68

An Almost-Linear Algorithm for Two-Processor Scheduling

Gabow, Harold N.

Journal:

Journal of the ACM

Year:

1982

Language:

english

File:

PDF, 795 KB

english, 1982

69

A Counting Approach to Lower Bounds for Selection Problems

Fussenegger, Frank, Gabow, Harold N.

Journal:

Journal of the ACM

Year:

1979

Language:

english

File:

PDF, 625 KB

english, 1979

70

[ACM Press the 2nd ACM international symposium - Long Beach, CA, USA (2001.10.04-2001.10.05)] Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing - MobiHoc '01 - Maximum flow-life curve for a wireless ad hoc network

Brown, Timthoy X., Gabow, Harold N., Zhang, Qi

Year:

2001

Language:

english

File:

PDF, 211 KB

english, 2001

71

[ACM Press the twentieth annual ACM symposium - Chicago, Illinois, United States (1988.05.02-1988.05.04)] Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 - Forests, frames, and games: algorithms for matroid sums and applications

Gabow, Harold, Westermann, Herbert

Year:

1988

Language:

english

File:

PDF, 1.28 MB

english, 1988

72

[ACM Press the tenth annual ACM symposium - San Diego, California, United States (1978.05.01-1978.05.03)] Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 - Algorithms for edge coloring bipartite graphs

Gabow, Harold N., Kariv, Oded

Year:

1978

Language:

english

File:

PDF, 511 KB

english, 1978

73

A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis

Gabow, Harold, Kohno, Tadayoshi

Journal:

Journal of Experimental Algorithmics

Year:

2001

File:

PDF, 498 KB

2001

74

[ACM Press the twenty-third annual ACM symposium - New Orleans, Louisiana, United States (1991.05.05-1991.05.08)] Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC '91 - A matroid approach to finding edge connectivity and packing arborescences

Gabow, Harold N.

Year:

1991

Language:

english

File:

PDF, 1.25 MB

english, 1991

75

Algorithmic Applications of Baur-Strassen’s Theorem

Cygan, Marek, Gabow, Harold N., Sankowski, Piotr

Journal:

Journal of the ACM

Year:

2015

Language:

english

File:

PDF, 357 KB

english, 2015

76

A Data Structure for Nearest Common Ancestors with Linking

Gabow, Harold N.

Journal:

ACM Transactions on Algorithms

Year:

2017

Language:

english

File:

PDF, 620 KB

english, 2017

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@z-lib.do

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски