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 (19) 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 (3358) 2002 (3935) 2003 (4721) 2004 (6380) 2005 (7643) 2006 (9040) 2007 (9373) 2008 (10901) 2009 (7436) 2010 (1338) 2011 (585) 2012 (573) 2013 (579) 2014 (689) 2015 (651) 2016 (245)
Publication types (Num. hits)
article(17739) book(18) incollection(2720) inproceedings(61787) phdthesis(9) proceedings(31)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 80488 occurrences of 18150 keywords

Results
Found 82313 publication records. Showing 82304 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
24Xiuqin Wang, Guangsheng Ma, Hao Wang A Novel Method for All Solutions SAT Problem. Search on Bibsonomy SNPD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF All Solutions, Observability Don't Cares, Circuit Structure, Boolean Satisfiability
24Patricia Mouy, Bruno Marre, Nicky Williams, Pascale Le Gall Generation of All-Paths Unit Test with Function Calls. Search on Bibsonomy ICST The full citation details ... 2008 DBLP  DOI  BibTeX  RDF all-paths unit test, unit test with function calls, unit test, constraint solving, structural testing, automatic generation, testing C programs
24Greg N. Frederickson Planar Graph Decomposition and All Pairs Shortest Paths. Search on Bibsonomy J. ACM The full citation details ... 1991 DBLP  DOI  BibTeX  RDF succinct encoding, approximation algorithm, NP-completeness, planar graph, graph embedding, all pairs shortest paths, outerplanar graph, compact routing table
23Sayantan Sur, Hyun-Wook Jin, Dhabaleswar K. Panda Efficient and Scalable All-to-All Personalized Exchange for InfiniBand-Based Clusters. Search on Bibsonomy ICPP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
23GuoQi Zhang, HongXin Wu An all-coefficient adaptive control method for a class of nonlinear time-varying systems. Search on Bibsonomy Science in China Series F: Information Sciences The full citation details ... 2009 DBLP  DOI  BibTeX  RDF all-coefficient adaptive control, stability, nonlinear, tracking control, time-varying
23Xinliang Zhang, Jing Xu, Jianji Dong, Dexiu Huang All-Optical Logic Gates Based on Semiconductor Optical Amplifiers and Tunable Filters. Search on Bibsonomy OSC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF all-optical logic gates, semiconductor optical amplifiers (SOAs), delay interferometer, bandpass filter
23Susana Sargento, Rui Valadas Accurate estimation of capacities and cross-traffic of all links in a path using ICMP timestamps. Search on Bibsonomy Telecommunication Systems The full citation details ... 2006 DBLP  DOI  BibTeX  RDF s Capacity, Cross-traffic, ICMP timestamps, Accurate estimation, All-path inference
23Tao Wu, Arun K. Somani Cross-talk attack monitoring and localization in all-optical networks. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF diagnosability of attacks, sparse monitoring, attack, crosstalk, all-optical network
23P. Jean-Jacques Herings, Ronald J. A. P. Peeters A Globally Convergent Algorithm to Compute All Nash Equilibria for n -Person Games. Search on Bibsonomy Annals OR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF computation of all equilibria, noncooperative game theory
23Yuh-Rau Wang, Shi-Jinn Horng, Chin-Hsiung Wu Efficient Algorithms for the All Nearest Neighbor and Closest Pair Problems on the Linear Array with a Reconfigurable Pipelined Bus System. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF LARPBS, reconfigurable bus model, Parallel algorithm, closest pair, all nearest neighbors
23Christian Fenger Performance Evaluations for Dynamic Wavelength Routed All-Optical Multifiber Networks. Search on Bibsonomy Telecommunication Systems The full citation details ... 2004 DBLP  DOI  BibTeX  RDF multiple fibers, dynamic, blocking probability, all-optical networks, wavelength routing
23Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd The all-or-nothing multicommodity flow problem. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF all-or-nothing multicommodity flow, approximation algorithms, online algorithms, multicommodity flow, oblivious routing, edge disjoint paths
23Grzegorz Malewicz A work-optimal deterministic algorithm for the asynchronous certified write-all problem. Search on Bibsonomy PODC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF design and analysis of parallel algorithms, write-all
23Chi-Yuan Chang, Sy-Yen Kuo Multicasting Optical Crossconnects with Fault Tolerance Mechanism and Wavelength Routing in All-Optical Networks. Search on Bibsonomy ICOIN (1) The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Fault Tolerance, Multicast, Wavelength Division Multiplexing, All-optical Networks, Wavelength Routing
23Christian Stary User diversity and design representation: Towards increased effectiveness in Design for All. Search on Bibsonomy Universal Access in the Information Society The full citation details ... 2001 DBLP  DOI  BibTeX  RDF User diversity, Individualisation, Symbolic/subsymbolic (knowledge) representation, Modality switching, Context-driven development, Adaptation, User modelling, System modelling, Domain modelling, Model-based design, Design for All
23Qian-Ping Gu, Shietung Peng Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks. Search on Bibsonomy ICPP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF WDM all-optical networks, routing algorithms, multistage interconnection networks, Permutation routing, edge-disjoint paths, BPC permutations
23Victor Boyko On the Security Properties of OAEP as an All-or-Nothing Transform. Search on Bibsonomy CRYPTO The full citation details ... 1999 DBLP  DOI  BibTeX  RDF all-or-nothing transforms, encryption modes, polynomial indistinguishability, random oracles, semantic security, exact security, OAEP
23Marco Ajmone Marsan, Andrea Fumagalli, Emilio Leonardi, Fabio Neri Modelling Slotted Multi-Channel Ring All-Optical Networks. Search on Bibsonomy MASCOTS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF WDM System, Access Protocol, All-Optical Network, Slotted Ring
23Dina Kravets, C. Greg Plaxton All Nearest Smaller Values on the Hypercube. Search on Bibsonomy IEEE Trans. Parallel Distrib. Syst. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF All nearest smaller values, normal hypercube algorithm, monotone polygon triangulation, Cartesian tree
22Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Derrick Weathersby Efficient Algorithms for All-to-All Communications in Multi-Port Message-Passing Systems. Search on Bibsonomy SPAA The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
Displaying result #221 - #240 of 82304 (20 per page; Change: )
Pages: [<<][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19]
[20][21][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.