The Pathologies of Big DataJACOBS, Adam.Communications of the ACM. 2009, Vol 52, Num 8, pp 36-44, issn 0001-0782, 9 p.Article

New layouts for multi-stage interconnection networksCAHIT, Ibrahim; ADALIER, Ahmet.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-25339-4, 2Vol, Part I, 842-848Conference Paper

The communication complexity of approximate set packing and coveringNISAN, Noam.Lecture notes in computer science. 2002, pp 868-875, issn 0302-9743, isbn 3-540-43864-5, 8 p.Conference Paper

On available bandwidth measurement implementation and experimentJINGSHA HE.Conference on Local Computer Networks. 2004, pp 772-773, isbn 0-7695-2260-2, 1Vol, 2 p.Conference Paper

The random linear bottleneck assignment problemPFERSCHY, U.RAIRO. Recherche opérationnelle. 1996, Vol 30, Num 2, pp 127-142, issn 0399-0559Article

Finite dominating sets for network location problemsHOOKER, J. N; GARFINKEL, R. S; CHEN, C. K et al.Operations research. 1991, Vol 39, Num 1, pp 100-118, issn 0030-364XArticle

Identifying informative subsets of the Gene Ontology with information bottleneck methodsBO JIN; XINGHUA LU.Bioinformatics (Oxford. Print). 2010, Vol 26, Num 19, pp 2445-2451, issn 1367-4803, 7 p.Article

IDENTIFYING PERFORMANCE BOTTLENECKS IN WORK-STEALING COMPUTATIONS : Tools and Environments for Multicore and Many-Core ArchitecturesTALLENT, Nathan R; MELLOR-CRUMMEY, John M.Computer (Long Beach, CA). 2009, Vol 42, Num 12, pp 44-50, issn 0018-9162, 7 p.Article

An instant solution of the 2×n bottleneck transportation problemSZWARC, W.Operations research letters. 1993, Vol 14, Num 5, pp 261-264, issn 0167-6377Article

A three rounds property of the AESMINIER, Marine.Lecture notes in computer science. 2005, pp 16-26, issn 0302-9743, isbn 3-540-26557-0, 11 p.Conference Paper

A variant of time minimizing assignment problemARORA, S; PURI, M. C.European journal of operational research. 1998, Vol 110, Num 2, pp 314-325, issn 0377-2217Article

Effects of frugivore impoverishment and seed predators on the recruitment of a keystone palmFADINI, Rodrigo F; FLEURY, Marina; DONATTI, Camila I et al.Acta oecologica (Montrouge). 2009, Vol 35, Num 2, pp 188-196, issn 1146-609X, 9 p.Article

On k-max-optimizationGORSKI, Jochen; RUZIKA, Stefan.Operations research letters. 2009, Vol 37, Num 1, pp 23-26, issn 0167-6377, 4 p.Article

Rapid development of application-specific network performance testsPAKIN, Scott.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-26032-3, 3Vol, part II,149-157Conference Paper

Towards technology independent and automated service activation and provisioningKONG, O; ROSE, I; CAMERON, D et al.IEEE / IFIP network operations and management symposium. 2002, pp 931-933, isbn 0-7803-7382-0, 3 p.Conference Paper

The β-assignment problemsCHANG, G. J; HO, P.-H.European journal of operational research. 1998, Vol 104, Num 3, pp 593-600, issn 0377-2217Article

On solving a variation of the assignment problemARMSTRONG, R. D; ZHIYING JIN.European journal of operational research. 1995, Vol 87, Num 1, pp 142-147, issn 0377-2217Article

Combinatorial Min-Max-Min-Sum optimisation over a polytopeKANCHAN MATHUR; SUSHMA BANSAL; PURI, M. C et al.Cahiers du Centre d'études de recherche opérationnelle. 1993, Vol 35, Num 3-4, pp 173-186, issn 0008-9737Article

Efficiently solvable special cases of bottleneck travelling salesman problemsBURKARD, R. E; SANDHOLZER, W.Discrete applied mathematics. 1991, Vol 32, Num 1, pp 61-76, issn 0166-218XArticle

Improving Performance on the InternetLEIGHTON, Tom.Communications of the ACM. 2009, Vol 52, Num 2, pp 44-51, issn 0001-0782, 8 p.Article

A shared memory benchmark in openMPMÜLLER, Matthias S.Lecture notes in computer science. 2002, pp 380-389, issn 0302-9743, isbn 3-540-43674-X, 10 p.Conference Paper

A linear-time algorithm for the bottleneck transportation problem with a fixed number of sourcesHOCHBAUM, D. S; WOEGINGER, G. J.Operations research letters. 1999, Vol 24, Num 1-2, pp 25-28, issn 0167-6377Article

Effect of carrier dynamics on quantum-dot laser performance and possibility of bi-exciton lasingSUGAWARA, M.SPIE proceedings series. 1998, pp 88-99, isbn 0-8194-2722-5, 2VolConference Paper

Discovering information patterns during conceptual designWIEGERS, T; KNOOP, W. G.Schriftenreihe WDK. 1997, pp 433-436, isbn 951-722-788-4, 3VolConference Paper

The bottleneck graph partition problemHOCHBAUM, D. S; PATHRIA, A.Networks (New York, NY). 1996, Vol 28, Num 4, pp 221-225, issn 0028-3045Article