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 (25) 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 (168) 1987 (299) 1988 (430) 1989 (457) 1990 (582) 1991 (414) 1992 (511) 1993 (563) 1994 (739) 1995 (991) 1996 (1007) 1997 (1276) 1998 (1394) 1999 (2138) 2000 (2675) 2001 (3359) 2002 (3938) 2003 (4721) 2004 (6381) 2005 (7645) 2006 (9041) 2007 (9383) 2008 (10904) 2009 (7437) 2010 (1341) 2011 (588) 2012 (576) 2013 (581) 2014 (696) 2015 (667) 2016 (499) 2017 (2)
Publication types (Num. hits)
article(17878) book(18) incollection(2721) inproceedings(61956) phdthesis(16) proceedings(33)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 80488 occurrences of 18150 keywords

Results
Found 82632 publication records. Showing 82622 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
14Yu-Chee Tseng, Sandeep K. S. Gupta All-to-All Personalized Communication in a Wormhole-Routed Torus. Search on Bibsonomy ICPP (1) The full citation details ... 1995 DBLP  BibTeX  RDF
14Jeanette P. Schmidt All Shortest Paths in Weighted Grid Graphs and its Application to Finding All Approximate Repeats in Strings. Search on Bibsonomy ISTCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
14Christophe Calvin, Stéphane Pérennes, Denis Trystram All-to-all broadcast in torus with wormhole-like routing. Search on Bibsonomy SPDP The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
14Rajeev Thakur, Alok N. Choudhary All-to-All Communication on Meshes with Wormhole Routing. Search on Bibsonomy IPPS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
14Laurence Boxer, Russ Miller Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar lattices. Search on Bibsonomy Pattern Recognition Letters The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
14C. R. J. Clapham, J. Sheehan All trees are 1-embeddable and all except stars are 2-embeddable. Search on Bibsonomy Discrete Mathematics The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
14Jean-Philippe Brunet, S. Lennart Johnsson All-To-All Broadcast and Applications On the Connection Machine. Search on Bibsonomy IJHPCA The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
14Alan Edelman Optimal Matrix Transposition and Bit Reversal on Hypercubes: All-to-All Personalized Communication. Search on Bibsonomy J. Parallel Distrib. Comput. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
14Phyllis G. Frankl, Stewart N. Weiss An Experimental Comparison of the Effectiveness of the All-Uses and All-Edges Adequacy Criteria. Search on Bibsonomy Symposium on Testing, Analysis, and Verification The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
14Ming-Syan Chen, Philip S. Yu, Kun-Lung Wu Optimal All-to-All Broadcasting Schemes in Distributed Systems. Search on Bibsonomy PDIS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
14Sunggu Lee, Kang G. Shin Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes. Search on Bibsonomy ICPP (3) The full citation details ... 1990 DBLP  BibTeX  RDF
14Boneung Koo, Jerry D. Gibson 0001 Experimental Comparison of All-Pole, All-Zero, and Pole-Zero Predictors for ADPCM Speech Coding. Search on Bibsonomy IEEE Trans. Communications The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
14John H. Major Pulling it all tegether: a well-designed user's manual. Search on Bibsonomy SIGUCCS The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
14Mark H. Overmars General Methods for `All Elements' and `All Pairs' Problems. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1981 DBLP  DOI  BibTeX  RDF
13Xiang Lian, Lei Chen 0002, Shaoxu Song Consistent query answers in inconsistent probabilistic databases. Search on Bibsonomy SIGMOD Conference The full citation details ... 2010 DBLP  DOI  BibTeX  RDF all-possible-repairs semantics, inconsistent probabilistic database, repair world, repaired possible world, consistent query answering
13Leyi Yin, Peng Li Exploiting reconfigurability for low-cost in-situ test and monitoring of digital PLLs. Search on Bibsonomy DAC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF all-digital PLLs, online calibration, reconfiguration, diagnosis, mixed-signal BIST
13Andrew Zalesky To burst or circuit switch? Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF all-optical switching, optical circuit switching, path decomposition, stochastic performance modeling, vacation queue, blocking probability, optical burst switching
13Zhe Song, Houxing Zhou, Jun Hu, Wei Hong Accurate evaluation of Green's functions in a layered medium by SDP-FLAM. Search on Bibsonomy Science in China Series F: Information Sciences The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Green’s functions, layered medium, fast all modes method, surface wave poles, leaky wave poles, Riemann sheet, branch cut
13Hongsik Choi, Ju Wang, Esther A. Hughes Scheduling for information gathering on sensor network. Search on Bibsonomy Wireless Networks The full citation details ... 2009 DBLP  DOI  BibTeX  RDF All-to-one information gathering, Scheduling, Sensor network, Hybrid network
13Giacomo Indiveri, Elisabetta Chicca, Rodney J. Douglas Artificial Cognitive Systems: From VLSI Networks of Spiking Neurons to Neuromorphic Cognition. Search on Bibsonomy Cognitive Computation The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Neuromorphic engineering, Spike-based learning, Winner-take-all, Soft WTA, VLSI, Cognition
Displaying result #601 - #620 of 82622 (20 per page; Change: )
Pages: [<<][21][22][23][24][25][26][27][28][29][30][31][32][33][34][35][36][37][38][39]
[40][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.