The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for all

Publication years (Num. hits)
1953-1960 (28) 1961-1962 (26) 1963-1964 (27) 1965-1966 (23) 1967 (25) 1968 (23) 1969 (23) 1970-1972 (20) 1973 (28) 1974 (65) 1975 (46) 1976 (66) 1977 (49) 1978 (69) 1979 (61) 1980 (82) 1981 (62) 1982 (86) 1983 (98) 1984 (120) 1985 (190) 1986 (167) 1987 (299) 1988 (430) 1989 (457) 1990 (582) 1991 (413) 1992 (511) 1993 (563) 1994 (739) 1995 (991) 1996 (1007) 1997 (1276) 1998 (1393) 1999 (2138) 2000 (2675) 2001 (3359) 2002 (3935) 2003 (4721) 2004 (6380) 2005 (7643) 2006 (9041) 2007 (9374) 2008 (10902) 2009 (7436) 2010 (1338) 2011 (586) 2012 (573) 2013 (579) 2014 (689) 2015 (653) 2016 (281)
Publication types (Num. hits)
article(17773) book(18) incollection(2720) inproceedings(61794) phdthesis(12) proceedings(31)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 80488 occurrences of 18150 keywords

Results
Found 82357 publication records. Showing 82348 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
10Cheng-Yu Hsieh, Wanjiun Liao All Optical Multicast Routing in Sparse-Splitting Optical Networks. Search on Bibsonomy LCN The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
10Maria J. García de la Banda, Peter J. Stuckey, Jeremy Wazny Finding all minimal unsatisfiable subsets. Search on Bibsonomy PPDP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF minimal unsatisfiable subsets, constraint solving
10Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks. Search on Bibsonomy ISAAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
10Toon Calders, Bart Goethals Mining All Non-derivable Frequent Itemsets. Search on Bibsonomy PKDD The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
10Hamdy S. Soliman, Chad Peyton An Efficient Routing Algorithm for All-Optical Networks with Turn Constraints. Search on Bibsonomy MASCOTS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
10Said Hamdioui, A. J. van de Goor, Mike Rodgers March SS: A Test for All Static Simple RAM Faults. Search on Bibsonomy MTDT The full citation details ... 2002 DBLP  DOI  BibTeX  RDF simple/linked faults, fault models, fault coverage, Memory testing, march test
10Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Hideo Bannai, Setsuo Arikawa Space-Economical Construction of Index Structures for All Suffixes of a String. Search on Bibsonomy MFCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
10Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger All-Norm Approximation Algorithms. Search on Bibsonomy SWAT The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
10Steffen Heber, Jens Stoye Finding All Common Intervals of k Permutations. Search on Bibsonomy CPM The full citation details ... 2001 DBLP  BibTeX  RDF
10Feodor F. Dragan Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach. Search on Bibsonomy WG The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
10Daisuke Shimada, Hideki Tanahashi, Kunihito Kato, Kazuhiko Yamamoto Extract and Display Moving Object in All Direction by Using Stereo Omnidirectional System(SOS). Search on Bibsonomy 3DIM The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
10Howard Cheng, George Labahn Computing all factorizations in ***. Search on Bibsonomy ISSAC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF structured matrices, polynomial factorization
10Susanna Varho, Paavo Alku A new predictive method for all-pole modelling of speech spectra with a compressed set of parameters. Search on Bibsonomy ISCAS (3) The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
10Petra Mutzel, René Weiskircher Optimizing over All Combinatorial Embeddings of a Planar Graph. Search on Bibsonomy IPCO The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
10Farn Wang Automatic Verification of Pointer Data-Structure Systems for All Numbers of Processes. Search on Bibsonomy World Congress on Formal Methods The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
10Sang Uk Shin, Kyung Hyune Rhee, Jae Woo Yoon Hash Functions and the MAC Using All-or-Nothing Property. Search on Bibsonomy Public Key Cryptography The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
10Xijun Zhang, Chunming Qiao Pipelined Transmission Scheduling in All-Optical TDM/WDM Rings. Search on Bibsonomy ICCCN The full citation details ... 1997 DBLP  DOI  BibTeX  RDF TDM/WDM, AAPC, Pipelined transmissions, Scheduling, Ring
10Martina Marré, Antonia Bertolino Unconstrained Duals and Their Use in Achieving All-Uses Coverage. Search on Bibsonomy ISSTA The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
10Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis All-Pairs Min-Cut in Sparse Networks. Search on Bibsonomy FSTTCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
10Ingo Wegener The Size of Reduced OBDDs and Optimal Read-once Branching Programs for Almost all Boolean Functions. Search on Bibsonomy WG The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
Displaying result #841 - #860 of 82348 (20 per page; Change: )
Pages: [<<][33][34][35][36][37][38][39]
[40][41][42][43][44][45][46][47][48][49][50][51][52][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.