Loading
Error: Cannot Load Popup Box
Skip to hit list
Adjust your hit list
Further result pages
Mobile

A
A
A

A

English
Deutsch
Français
Español
Polski
Ελληνικά
Українська
中文
 Logged in as

Log Out

Login
BASIC
SEARCH
ADVANCED
SEARCH
HELP
BROWSING
SEARCH
HISTORY
Your search
Search For:
Entire Document
Title
Author
Subject
Boost open access documents
Find
Linguistics tools
Verbatim search
Additional word forms
Multilingual synonyms
Statistics
2,296 hits
in 72,404,354 documents
in 0.32 seconds
Please leave the following field blank:
Home
»
Search: Felix Fischer
Hit List
Hit list
1.
Ministro Fernando Gonçalves: perfil
Open Access
Title:
Ministro Fernando Gonçalves: perfil
Author:
Felix Fischer
Felix Fischer
Minimize authors
Publisher:
Superior Tribunal de Justiça
Year of Publication:
20100727
Source:
Ministros do Superior Tribunal de Justiça no Tribunal Superior Eleitoral; v. 2, n. 6 (2010): Julgados do Ministro Fernando Gonçalves; p. 11
Ministros do Superior Tribunal de Justiça no Tribunal Superior Eleitoral; v. 2, n. 6 (2010): Julgados do Ministro Fernando Gonçalves; p. 11
Minimize
Language:
pt
URL:
http://www.stj.jus.br/publicacaoseriada/index.php/ministros/article/view/202
http://www.stj.jus.br/publicacaoseriada/index.php/ministros/article/view/202
Minimize
Content Provider:
Publicações do Superior Tribunal de Justiça (STJ)
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
2.
Ministro Ari Pargendler: perfil
Open Access
Title:
Ministro Ari Pargendler: perfil
Author:
Felix Fischer
Felix Fischer
Minimize authors
Publisher:
Superior Tribunal de Justiça
Year of Publication:
20100727
Source:
Ministros do Superior Tribunal de Justiça no Tribunal Superior Eleitoral; v. 2, n. 4 (2010): Julgados do Ministro Ari Pargendler; p. 1112
Ministros do Superior Tribunal de Justiça no Tribunal Superior Eleitoral; v. 2, n. 4 (2010): Julgados do Ministro Ari Pargendler; p. 1112
Minimize
Language:
pt
URL:
http://www.stj.jus.br/publicacaoseriada/index.php/ministros/article/view/679
http://www.stj.jus.br/publicacaoseriada/index.php/ministros/article/view/679
Minimize
Content Provider:
Publicações do Superior Tribunal de Justiça (STJ)
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
3.
Enfam deve ser protagonista na concepção de um novo judiciário
Open Access
Title:
Enfam deve ser protagonista na concepção de um novo judiciário
Author:
Felix Fischer
Felix Fischer
Minimize authors
Publisher:
Escola Nacional d Formação e Aperfeiçoamento de Magistrados
Year of Publication:
20110404
Source:
Boletim da Enfam; n. 6 (abr./maio 2010); p. 34
Boletim da Enfam; n. 6 (abr./maio 2010); p. 34
Minimize
Language:
pt
URL:
http://www.stj.jus.br/publicacaoseriada/index.php/boletimdaenfam/article/view/1585
http://www.stj.jus.br/publicacaoseriada/index.php/boletimdaenfam/article/view/1585
Minimize
Content Provider:
Publicações do Superior Tribunal de Justiça (STJ)
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
4.
Ministro Felix Fischer
Open Access
Title:
Ministro
Felix
Fischer
Author:
Felix Fischer
Felix Fischer
Minimize authors
Publisher:
Escola Nacional d Formação e Aperfeiçoamento de Magistrados
Year of Publication:
20110404
Source:
Boletim da Enfam; n. 2 (jul./ago. 2009); p. 34
Boletim da Enfam; n. 2 (jul./ago. 2009); p. 34
Minimize
Language:
pt
URL:
http://www.stj.jus.br/publicacaoseriada/index.php/boletimdaenfam/article/view/1624
http://www.stj.jus.br/publicacaoseriada/index.php/boletimdaenfam/article/view/1624
Minimize
Content Provider:
Publicações do Superior Tribunal de Justiça (STJ)
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
5.
Computing the minimal covering set
Open Access
Title:
Computing the minimal covering set
Author:
Felix Brandt
;
Felix Fischer
Felix Brandt
;
Felix Fischer
Minimize authors
Description:
We present the first polynomialtime algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset of the minimal covering set known as the essential set. On the other hand, we show that no efficient algorithm exists for two variants of the minimal covering set, the...
We present the first polynomialtime algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset of the minimal covering set known as the essential set. On the other hand, we show that no efficient algorithm exists for two variants of the minimal covering set, the minimal upward covering set and the minimal downward covering set, unless P equals NP. Finally, we observe a strong relationship between von NeumannMorgenstern stable sets and upward covering on the one hand, and the Banks set and downward covering on the other.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20100814
Source:
http://www.tcs.informatik.unimuenchen.de/%7Efischerf/publications/bf_mss08.pdf
http://www.tcs.informatik.unimuenchen.de/%7Efischerf/publications/bf_mss08.pdf
Minimize
Document Type:
text
Language:
en
Subjects:
Social Choice Theory ; Minimal Covering Set ; Essential Set ; Uncovered Set ; Computational Complexity JEL classification codes
Social Choice Theory ; Minimal Covering Set ; Essential Set ; Uncovered Set ; Computational Complexity JEL classification codes
Minimize
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.169.1022
http://www.tcs.informatik.unimuenchen.de/%7Efischerf/publications/bf_mss08.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.169.1022
http://www.tcs.informatik.unimuenchen.de/%7Efischerf/publications/bf_mss08.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
6.
PageRank as a Weak Tournament Solution
Open Access
Title:
PageRank as a Weak Tournament Solution
Author:
Felix Brandt
;
Felix Fischer
Felix Brandt
;
Felix Fischer
Minimize authors
Description:
We observe that ranking systems—a theoretical framework for web page ranking and collaborative filtering introduced by Altman and Tennenholtz—and tournament solutions—a wellstudied area of social choice theory—are strongly related. This relationship permits a mutual transfer of axioms and solution concepts. As a first step, we formally analyze ...
We observe that ranking systems—a theoretical framework for web page ranking and collaborative filtering introduced by Altman and Tennenholtz—and tournament solutions—a wellstudied area of social choice theory—are strongly related. This relationship permits a mutual transfer of axioms and solution concepts. As a first step, we formally analyze a tournament solution that is based on Google’s PageRank algorithm and study its interrelationships with common tournament solutions. It turns out that the PageRank set is always contained in both the Schwartz set and the uncovered set, but may be disjoint from most other tournament solutions. While PageRank does not satisfy various standard properties from the tournament literature, it can be much more discriminatory than established tournament solutions.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20120221
Source:
http://www.tcs.informatik.unimuenchen.de/%7Efischerf/publications/bf_wine07.pdf
http://www.tcs.informatik.unimuenchen.de/%7Efischerf/publications/bf_wine07.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.169.1143
http://www.tcs.informatik.unimuenchen.de/%7Efischerf/publications/bf_wine07.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.169.1143
http://www.tcs.informatik.unimuenchen.de/%7Efischerf/publications/bf_wine07.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
7.
On the Rate of Convergence of Fictitious Play
Open Access
Title:
On the Rate of Convergence of Fictitious Play
Author:
Felix Brandt, Felix Fischer
Felix Brandt, Felix Fischer
Minimize authors
Description:
Fictitious play is a simple learning algorithm for strategic games that proceeds in rounds. In each round, the players play a best response to a mixed strategy that is given by the empirical frequencies of actions played in previous rounds. There is a close relationship between fictitious play and the Nash equilibria of a game: if the empirical ...
Fictitious play is a simple learning algorithm for strategic games that proceeds in rounds. In each round, the players play a best response to a mixed strategy that is given by the empirical frequencies of actions played in previous rounds. There is a close relationship between fictitious play and the Nash equilibria of a game: if the empirical frequencies of fictitious play converge to a strategy profile, this strategy profile is a Nash equilibrium. While fictitious play does not converge in general, it is known to do so for certain restricted classes of games, such as constantsum games, nondegenerate 2 × n games, and potential games. We study the rate of convergence of fictitious play and show that, in all the classes of games mentioned above, fictitious play may require an exponential number of rounds (in the size of the representation of the game) before some equilibrium action is eventually played. In particular, we show the above statement for symmetric constantsum winlosetie games.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20130531
Source:
http://www.tcs.informatik.unimuenchen.de/%7Efischerf/publications/bfh_fplay.pdf
http://www.tcs.informatik.unimuenchen.de/%7Efischerf/publications/bfh_fplay.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.169.1207
http://www.tcs.informatik.unimuenchen.de/%7Efischerf/publications/bfh_fplay.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.169.1207
http://www.tcs.informatik.unimuenchen.de/%7Efischerf/publications/bfh_fplay.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
8.
Computational Aspects of Covering in Dominance Graphs
Open Access
Title:
Computational Aspects of Covering in Dominance Graphs
Author:
Felix Brandt
;
Felix Fischer
Felix Brandt
;
Felix Fischer
Minimize authors
Description:
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as diverse as voting theory, game theory, and argumentation theory. Some particularly attractive solution sets are defined in terms of a covering relation—a transitive subrelati...
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as diverse as voting theory, game theory, and argumentation theory. Some particularly attractive solution sets are defined in terms of a covering relation—a transitive subrelation of the original relation. We consider three different types of covering (upward, downward, and bidirectional) and the corresponding solution concepts known as the uncovered set and the minimal covering set. We present the first polynomialtime algorithm for finding the minimal bidirectional covering set (an acknowledged open problem) and prove that deciding whether an alternative is in a minimal upward or downward covering set is NPhard. Furthermore, we obtain various settheoretical inclusions, which reveal a strong connection between von NeumannMorgenstern stable sets and upward covering on the one hand, and the Banks set and downward covering on the other hand. In particular, we show that every stable set is also a minimal upward covering set.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20100531
Source:
http://www7.in.tum.de/~brandtf/papers/aaai2007.pdf
http://www7.in.tum.de/~brandtf/papers/aaai2007.pdf
Minimize
Document Type:
text
Language:
en
DDC:
511 General principles of mathematics
(computed)
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.7346
http://www7.in.tum.de/~brandtf/papers/aaai2007.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.7346
http://www7.in.tum.de/~brandtf/papers/aaai2007.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
9.
On the Hardness and Existence of QuasiStrict Equilibria
Open Access
Title:
On the Hardness and Existence of QuasiStrict Equilibria
Author:
Felix Brandt
;
Felix Fischer
Felix Brandt
;
Felix Fischer
Minimize authors
Description:
This paper investigates the computational properties of quasistrict equilibrium, an attractive equilibrium refinement proposed by Harsanyi, which was recently shown to always exist in bimatrix games. We prove that deciding the existence of a quasistrict equilibrium in games with more than two players is NPcomplete. We further show that, in co...
This paper investigates the computational properties of quasistrict equilibrium, an attractive equilibrium refinement proposed by Harsanyi, which was recently shown to always exist in bimatrix games. We prove that deciding the existence of a quasistrict equilibrium in games with more than two players is NPcomplete. We further show that, in contrast to Nash equilibrium, the support of quasistrict equilibrium in zerosum games is unique and propose a linear program to compute quasistrict equilibria in these games. Finally, we prove that every symmetric multiplayer game where each player has two actions at his disposal contains an efficiently computable quasistrict equilibrium which may itself be asymmetric.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20100531
Source:
http://www7.in.tum.de/~brandtf/papers/quasistrict.pdf
http://www7.in.tum.de/~brandtf/papers/quasistrict.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.8491
http://www7.in.tum.de/~brandtf/papers/quasistrict.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.8491
http://www7.in.tum.de/~brandtf/papers/quasistrict.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
10.
Computing the minimal covering set
Open Access
Title:
Computing the minimal covering set
Author:
Felix Brandt
;
Felix Fischer
Felix Brandt
;
Felix Fischer
Minimize authors
Description:
We present the first polynomialtime algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset of the minimal covering set known as the essential set. On the other hand, we show that no efficient algorithm exists for two variants of the minimal covering set, the...
We present the first polynomialtime algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset of the minimal covering set known as the essential set. On the other hand, we show that no efficient algorithm exists for two variants of the minimal covering set, the minimal upward covering set and the minimal downward covering set, unless P equals NP. Finally, we observe a strong relationship between von NeumannMorgenstern stable sets and upward covering on the one hand, and the Banks set and downward covering on the other.
Minimize
Publisher:
ACM Press
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20091226
Source:
http://www7.in.tum.de/~brandtf/papers/covering.pdf
http://www7.in.tum.de/~brandtf/papers/covering.pdf
Minimize
Document Type:
text
Language:
en
Subjects:
Social Choice Theory ; Minimal Covering Set ; Essential Set ; Uncovered Set ; Computational Complexity JEL classification codes
Social Choice Theory ; Minimal Covering Set ; Essential Set ; Uncovered Set ; Computational Complexity JEL classification codes
Minimize
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.8691
http://www7.in.tum.de/~brandtf/papers/covering.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.8691
http://www7.in.tum.de/~brandtf/papers/covering.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
Export Record
All Records
Export
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Adjust your hit list
Sort Your Results
Refine Search Result
More Options
Sort Your Results
Sort by:
Relevance
Author, ZA
Author, AZ
Title, AZ
Title, ZA
Date of publication, descending
Date of publication, ascending
Refine Search Result
Author
(1,698) Bocci, Andrea
(1,342) Fisher, Matthew
(1,182) Müller, Thomas
(1,061) Kim, Min Suk
(1,014) Husemann, Ulrich
(969) Collard, Caroline
(967) Dobson, Marc
(966) Khakzad, Mohsen
(933) Nugent, Ian Michael
(918) Haller, Johannes
(900) Sarangi, Tapas
(898) Hill, John
(895) Cattai, Ariella
(895) Kuleshov, Sergey
(895) Shabalina, Elizaveta
(890) Flechl, Martin
(886) Skovpen, Kirill
(883) Bona, Marcella
(882) Han, Liang
(882) Krieger, Peter
(881) Abbott, Brad
(881) Abdallah, Jalal
(881) Abdinov, Ovsat
(881) Abramowicz, Halina
(881) Abreu, Henso
(881) Acharya, Bobby Samir
(881) Adams, David
(881) Adelman, Jahred
(881) Adye, Tim
(881) AguilarSaavedra, Juan Antonio
(881) Ahlen, Steven
(881) Aielli, Giulio
(881) Akimoto, Ginga
(881) Albrand, Solveig
(881) Aleksa, Martin
(881) Aleksandrov, Igor
(881) Alexa, Calin
(881) Alexander, Gideon
(881) Alexopoulos, Theodoros
(881) Alhroob, Muhammad
(881) Alimonti, Gianluca
(881) Alison, John
(881) Allport, Phillip
(881) Aloisio, Alberto
(881) Alonso, Alejandro
(881) Alviggi, Mariagrazia
(881) Amelung, Christoph
(881) Amram, Nir
(881) Anastopoulos, Christos
(881) Andeen, Timothy
(881) Anders, Christoph Falk
(881) Anderson, Kelby
(881) Andreazza, Attilio
(881) Andrei, George Victor
(881) Angerami, Aaron
(881) Anjos, Nuno
(881) Annovi, Alberto
(881) Antonelli, Mario
(881) Antos, Jaroslav
(881) Anulli, Fabio
(881) Arabidze, Giorgi
(881) Arai, Yasuo
(881) Arce, Ayana
(881) Arguin, JeanFrancois
(881) Arik, Metin
(881) Armbruster, Aaron James
(881) Arnaez, Olivier
(881) Artamonov, Andrei
(881) Asai, Shoji
(881) Asquith, Lily
(881) Assamagan, Ketevi
(881) Augsten, Kamil
(881) Aurousseau, Mathieu
(881) Azuelos, Georges
(881) Baak, Max
(881) Bachacou, Henri
(881) Bachas, Konstantinos
(881) Backes, Moritz
(881) Bagnaia, Paolo
(881) Bai, Yu
(881) Bain, Travis
(881) Baines, John
(881) Baker, Oliver Keith
(881) Banas, Elzbieta
(881) Banerjee, Swagato
(881) Barberio, Elisabetta Luigia
(881) Barberis, Dario
(881) Barbero, Marlon
(881) Barillari, Teresa
(881) Barisonzi, Marcello
(881) Barklow, Timothy
(881) Barlow, Nick
(881) Barnett, Bruce
(881) Barnett, Michael
(881) Baroncelli, Antonio
(881) Barr, Alan
(881) Barreiro, Fernando
(881) Bartoldus, Rainer
(881) Bates, Richard
(881) Batley, Richard
Author:
Subject
(679) particle physics experiment
(457) experiment hep
(307) cern lhc coll
(282) p p scattering
(272) hep ex
(266) experimental results
(237) info eu repo classification ddc 530
(167) atlas
(155) cms
(153) 8000 gev cms
(77) 7000 gev cms
(59) background
(55) transverse momentum dependence
(54) p p colliding beams
(46) rapidity dependence
(42) transverse momentum missing energy
(41) 7000 8000 gev cms
(41) monte carlo
(40) differential cross section measured
(40) top pair production
(38) z0 leptonic decay
(36) higher order 1
(33) channel cross section measured
(33) jet bottom
(33) jet multiplicity
(32) supersymmetry
(31) dilepton final state
(31) standard model validity test
(30) new physics search for
(29) experiment nucl
(29) info eu repo classification ddc 550
(28) quantum chromodynamics perturbation theory
(27) nuclear physics experiment
(26) channel cross section branching ratio upper limit
(25) lead
(23) higgs particle mass
(22) jet transverse momentum
(21) parton showers
(21) quantum chromodynamics
(21) transverse energy missing energy
(20) heavy ion scattering
(19) cross section upper limit
(19) nucl ex
(19) parton distribution function
(19) z0 associated production
(17) cell parameters
(17) crystal structure
(17) crystal system
(17) experimental 3d coordinates
(17) higgs particle hadroproduction
(17) humans
(17) sensitivity
(17) space group
(17) stop pair production
(17) w leptonic decay
(16) signature
(16) z0 lepton lepton
(15) 610 medical sciences medicine
(15) efficiency
(15) polymorphism
(15) rapidity
(15) vector boson leptonic decay
(14) 610 medicine health
(14) body mass index
(14) bottom pair production
(14) computational complexity
(14) higgs particle 2photon
(14) higgs particle decay modes
(14) impact parameter dependence
(14) jet hadroproduction
(14) lepton final state
(14) mass dependence
(14) new particle search for
(14) w associated production
(14) water
(13) anti kt algorithm
(13) bottom particle identification
(13) genome wide association study
(13) higgs particle radiative decay
(13) jet multiple production
(13) lepton multiplicity
(13) single nucleotide
(13) transverse momentum high
(13) w hadroproduction
(12) 2760 gev cms nucleon
(12) black sea ctd density
(12) cross section measured
(12) gluon gluon fusion
(12) higgs particle associated production
(12) numerical calculations monte carlo
(12) p p higgs particle anything
(12) vector boson fusion
(12) z0 hadroproduction
(11) algorithms
(11) data analysis method
(11) dimuon mass spectrum
(11) j psi 3100 leptonic decay
(11) kinematics
(11) mass lower limit
(11) new physics
Subject:
Dewey Decimal Classification (DDC)
(327) Physics [53*]
(58) Medicine & health [61*]
(29) Mathematics [51*]
(25) Computer science, knowledge & systems [00*]
(25) Astronomy [52*]
(16) Chemistry [54*]
(13) Life sciences; biology [57*]
(11) Economics [33*]
(11) Earth sciences & geology [55*]
(8) Social sciences, sociology & anthropology...
(7) Education [37*]
(6) Plants (Botany) [58*]
(5) Engineering [62*]
(5) Arts [70*]
(3) Other religions [29*]
(3) Sports, games & entertainment [79*]
(2) Library & information sciences [02*]
(2) Psychology [15*]
(2) Social problems & social services [36*]
(2) Customs, etiquette & folklore [39*]
(2) Language [40*]
(2) Geography & travel [91*]
(2) History of Asia [95*]
(1) Statistics [31*]
(1) Science [50*]
(1) Chemical engineering [66*]
(1) Manufacturing [67*]
(1) Literature, rhetoric & criticism [80*]
Dewey Decimal Classification (DDC):
Year of Publication
(698) 2014
(491) 2012
(434) 2013
(223) 2015
(156) 2011
(86) 2010
(28) 2008
(25) 1995
(25) 2009
(22) 2007
(18) 1996
(12) 2005
(12) 2006
(10) 2000
(9) 1994
(8) 2003
(5) 2004
(4) 2001
(3) 1963
(3) 1998
(2) 1906
(2) 1969
(1) 1903
(1) 1920
(1) 1922
(1) 1932
(1) 1957
(1) 1962
(1) 1974
(1) 1981
(1) 1992
(1) 2002
Year of Publication:
Content Provider
(697) CERN (Switzerland)
(515) DESY Hamburg
(488) Joint Inst. for Nuclear Research: JINR Document...
(128) CiteSeerX
(66) DataCite Metadata Store
(42) Aalborg Univ. (AAU): VBN
(41) PubMed Central
(20) Alfred Wegener Inst.: ePIC
(19) PANGAEA (Earth & Environmental Science)
(16) Aachen RWTH: Publications
(13) HighWire Press
(12) Bern Univ.: BORIS
(11) ArXiv.org
(11) Zurich Univ.: ZORA
(8) Manchester Univ.: eScholar Services
(7) Finland National Inst. for Health and Welfare...
(7) Groningen Univ.
(7) Lund Univ. Publications (LUP)
(6) BDJur (Brazil)
(6) London King's College: Research Portal
(6) Dundee Univ.: Online Publications
(5) BioMed Central
(5) Queensland Univ.: UQ eSpace
(4) CSIC (Spanish National Research Council)
(4) Harvard Univ.: DASH
(4) Belfast Queen's Univ.: Research Portal
(4) RePEc.org
(4) Superior Tribunal de Justiça (STJ): EJournals
(4) Frankfurt/Main Univ.: Publications
(4) Tübingen Univ.: Publication System
(3) DOAJ Articles
(3) Aachen Univ. of Applied Sciences: Publications
(3) Jülich Forschungszentrum: JuSER
(3) Bochum Univ. (RUB): Campus Research Bibliography
(3) Michigan Univ.: Digital Library (DLPS)
(3) Basel Univ.: edoc
(3) Massachusetts Univ., Medical School: eScholarship
(3) NebraskaLincoln Univ. (UNL): Image &...
(3) Rotterdam Erasmus Univ.: RePub
(2) Biodiversty Heritage Library (BHL)
(2) Gallica (Bib. Nationale de France)
(2) Dagstuhl Research Online Publication Server
(2) Copenhagen Univ.: CURIS
(2) pedocs document server
(2) Zurich ETH: ECollection
(2) Gotland Univ.: Publications
(2) Int. Federation for Information Processing...
(2) Lausanne Ecole Polytechnique Fed.: Infoscience
(2) LSHTM: Research Online
(2) NERC (United Kingdom)
(2) Southern Denmark Univ.: Research Output
(2) Texas State Univ.: Digital Collections
(2) Munich TU: mediaTUM
(2) Bielefeld Univ.: Publications
(2) London Univ. College: UCL Discovery
(2) Glasgow Univ.
(2) Oxford Univ.: Research Archive (ORA)
(2) Aarhus Univ.: Pure
(2) WallonieBruxelles Académie Univ.: DIfusion
(2) Debrecen Univ.
(2) Frankfurt/Main Univ.: Edocs  Publikationssystem
(2) Lausanne Univ.: Serval
(2) Leuven KU: Lirias
(2) Louvain Univ. Académie: DIAL
(2) Milan Univ.: Archivio Istituzionale della Ricerca
(2) Nijmegen Univ.
(2) São Paulo Univ.: Theses and Dissertations
(2) Uppsala Univ.: Publications
(1) AIS Electronic Library (AISeL)
(1) American Museum of Natural History
(1) Archive Artxiker Artxiboa (CCSD)
(1) IBICT (Brazil): Teses e Dissertações
(1) HAL  Hyper Article en Ligne
(1) National Cheng Kung Univ.
(1) DUMAS (France)
(1) EPA (USA)
(1) FU Berlin: Institutional Repository
(1) epress (EJournals)
(1) PhyDid (EJournal)
(1) KITLV journals
(1) LSH (Iceland)
(1) LeibnizOpen
(1) Leicester Univ.
(1) MaxDelbrueckCenter for Molecular Medicin (MDC)
(1) CCSD: memSIC
(1) Munich LMU: Digital theses
(1) Nanyang Technological Univ.: DRNTU
(1) Liège Univ.: ORBi
(1) London Queen Mary Univ.: Research Online
(1) Berlin State Library: Digitalisierte Sammlungen
(1) London Univ.: SOAS
(1) Southampton Univ.: ePrints Soton
(1) Social Science Open Access Repository (SSOAR)
(1) St Andrews Univ.: DRR
(1) London St George Univ.: Repository
(1) Göttingen Univ.: GoeScholar
(1) Bryn Mawr, Haverford, Swarthmore Coll.:...
(1) Karlsruhe Univ.: Scientific Articles Repository
(1) Konstanz Univ.: KOPS
(1) Münster Univ. (WWU): EJournals
Content Provider:
Language
(1,168) English
(1,076) Unknown
(32) German
(15) Portuguese
(2) Hungarian
(2) Swedish
(1) Dutch; Flemish
(1) French
(1) Norwegian
Language:
Document Type
(1,245) Unknown
(697) Article, Journals
(240) Text
(57) Reports, Papers, Lectures
(37) Primary Data
(8) Books
(7) Theses
(3) Audio
(2) Images
Document Type:
Access
(1,658) Unknown
(638) Open Access
Access:
More Options
»
Search History
»
Get RSS Feed
»
Get ATOM Feed
»
Email this Search
»
Save Search
»
Browsing
»
Search Plugin
Further result pages
Results:
1

2

3

4

5

6

7

8

9

10

11
Next »
[100]
New Search »
Currently in BASE: 72,404,354 Documents of 3,481
Content Sources
About BASE

Contact

BASE Lab

Imprint
© 20042015 by
Bielefeld University Library
Search powered by
Solr
&
VuFind
.
Suggest Repository
BASE Interfaces
Currently in BASE: 72,404,354 Documents of 3,481 Content Sources
http://www.basesearch.net