The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for 68W40 with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2001-2009 (18) 2010 (1)
Publication types (Num. hits)
article(19)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 40 occurrences of 14 keywords

Results
Found 19 publication records. Showing 19 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
22S. Thomas McCormick, Satoru Fujishige Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization. Search on Bibsonomy Math. Program. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) Primary: 65K05, Secondary: 90C27, 68W40
22Gabriela Jeronimo, Guillermo Matera, Pablo Solernó, Ariel Waissbein Deformation Techniques for Sparse Systems. Search on Bibsonomy Found. Comput. Math. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 14Q05, 52B20, 12Y05, 13F25, 14Q20, 68W40, 68W30
22Ezequiel Dratman, Guillermo Matera, Ariel Waissbein Robust Algorithms For Generalized Pham Systems. Search on Bibsonomy Comput. Complex. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Primary 14Q05, 68W30 - Secondary 12Y05, 13F25, 14Q20, Subject classification, 68W40
22Clemens Heuberger, James A. Muir Unbalanced digit sets and the closest choice strategy for minimal weight integer representations. Search on Bibsonomy Des. Codes Cryptogr. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classifications (2000) 11A63, 94A60, 68W40
22Manuel Ceballos, Juan Núñez 0001, Ángel F. Tenorio Algorithm to compute the maximal abelian dimension of Lie algebras. Search on Bibsonomy Computing The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 17B30, 17B05, 68Q25, 68W40
22János Balogh, József Békési, Gábor Galambos, Mihály Csaba Markót Improved lower bounds for semi-online bin packing problems. Search on Bibsonomy Computing The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 68Q25, 68W40, 68W25
22Dima Grigoriev Probabilistic Communication Complexity Over The Reals. Search on Bibsonomy Comput. Complex. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Subject classification, 68W40
22Shahar Sarid, Amir Shapiro Classifying the multi robot path finding problem into a quadratic competitive complexity class. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classifications (2000) 68Q25, 68T40, 11Y16, 93C85, 68Q17, 68Q15, 68W40, 68W15
22Zheng Gong, Xuejia Lai, Kefei Chen A synthetic indifferentiability analysis of some block-cipher-based hash functions. Search on Bibsonomy Des. Codes Cryptogr. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF AMS Classifications 68W40, 68Q25
22Klaus Jansen, Hu Zhang 0004 Approximation algorithms for general packing problems and their application to the multicast congestion problem. Search on Bibsonomy Math. Program. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 68W25, 90C25, 90C05, 68W40, 68M10
22Béla Csaba, András Pluhár A randomized algorithm for the on-line weighted bipartite matching problem. Search on Bibsonomy J. Sched. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 68R10, 68W40, 68W25
22K. Subramani 0001 Computing inversion pair cardinality through partition-based sorting. Search on Bibsonomy Computing The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 68Q25, 68R99, 68W40
22Amr Elmasry, Claus Jensen, Jyrki Katajainen Two new methods for constructing double-ended priority queues from priority queues. Search on Bibsonomy Computing The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 68P05, 68P10, 68Q25, 68W40
22Sergei A. Obiedkov, Vincent Duquenne Attribute-incremental construction of the canonical implication basis. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classifications (2000) 03G10, 06A15, 68W05, 68R05, 68W40
22K. Subramani 0001 On a decision procedure for quantified linear programs. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classifications (2000) 68W05, 68Q17, 90C05, 68W40
22Jose H. Blanchet, Peter W. Glynn, Jingchen Liu Fluid heuristics, Lyapunov bounds and efficient importance sampling for a heavy-tailed G/G/1 queue. Search on Bibsonomy Queueing Syst. Theory Appl. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 60G50, 60J05, 60G70, 60J20, 68W40
22Nader H. Bshouty, Michael Kaminski Polynomial multiplication over finite fields: from quadratic to straight-line complexity. Search on Bibsonomy Comput. Complex. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Subject classification. 12Y05, 68Q25, 68W40, 68W30
22Christopher Wolf, An Braeken, Bart Preneel On the security of stepwise triangular systems. Search on Bibsonomy Des. Codes Cryptogr. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF 11T55, 12F99, 51E26, 14Q99, 14N10, 68Q25, AMS Classification 94A60, 68W40
22Richard Cole 0001, Kirstin Ost, Stefan Schirra Edge-Coloring Bipartite Multigraphs in O(E log D) Time. Search on Bibsonomy Comb. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 68W05, 68W40
Displaying result #1 - #19 of 19 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license