( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Model for Minimizing Active Processor Time.

, , и . ESA, том 7501 из Lecture Notes in Computer Science, стр. 289-300. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

n n n

Harold Priestley

Harold Ebneth

Harold Haber

Harold Hurwitz

 

Другие публикации лиц с тем же именем

Algorithms for Graphic Polymatroids and Parametric s-Sets.. SODA, стр. 88-97. ACM/SIAM, (1995)Performance Analysis and Portability of the PLUM Load Balancing System., , и . Euro-Par, том 1470 из Lecture Notes in Computer Science, стр. 307-317. Springer, (1998)Packing Algorithms for Arborescences (and Spanning Trees) in Capacitated Graphs., и . IPCO, том 920 из Lecture Notes in Computer Science, стр. 388-402. Springer, (1995)Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract)., и . ICALP, том 194 из Lecture Notes in Computer Science, стр. 210-220. Springer, (1985)A Linear-Time Algorithm for a Special Case of Disjoint Set Union., и . J. Comput. Syst. Sci., 30 (2): 209-221 (1985)A Matroid Approach to Finding Edge Connectivity and Packing Arborescences.. J. Comput. Syst. Sci., 50 (2): 259-273 (1995)Scaling Algorithms for Network Problems.. J. Comput. Syst. Sci., 31 (2): 148-168 (1985)Finding Long Paths, Cycles and Circuits., и . ISAAC, том 5369 из Lecture Notes in Computer Science, стр. 752-763. Springer, (2008)Applications of a Poset Representation to Edge Connectivity and Graph Rigidity. FOCS, стр. 812-821. IEEE Computer Society, (1991)Using Expander Graphs to Find Vertex Connectivity.. FOCS, стр. 410-420. IEEE Computer Society, (2000)