The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "Comb. Probab. Comput."( http://dblp.L3S.de/Venues/Comb._Probab._Comput. )

URL (DBLP): http://dblp.uni-trier.de/db/journals/cpc

Publication years (Num. hits)
1992 (32) 1993 (38) 1994 (41) 1995 (27) 1996 (34) 1997 (42) 1998 (45) 1999 (23) 2000 (41) 2001 (34) 2002 (46) 2003 (46) 2004 (54) 2005 (36) 2006 (61) 2007 (57) 2008 (56) 2009 (52) 2010 (41) 2011 (59) 2012 (57) 2013 (49) 2014 (53) 2015 (42) 2016 (50) 2017 (53) 2018 (50) 2019 (49) 2020 (48) 2021 (51) 2022 (49) 2023 (42) 2024 (23)
Publication types (Num. hits)
article(1481)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 1481 publication records. Showing 1481 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Peter Frankl, Jian Wang 0092 Intersecting families without unique shadow. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Matthew Jenssen, Marcus Michelen, Mohan Ravichandran Quasipolynomial-time algorithms for Gibbs point processes. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Igor Araujo, József Balogh, Robert A. Krueger, Simón Piga, Andrew Treglown On oriented cycles in randomly perturbed digraphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Rutger Campbell, Katie Clinch, Marc Distel, J. Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, David R. Wood Product structure of graph classes with bounded treewidth. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Noe Kawamoto, Akira Sakai Spread-out limit of the critical points for lattice trees and lattice animals in dimensions. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Maria Axenovich A class of graphs of zero Turán density in a hypercube. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Maria Axenovich, Domagoj Bradac, Lior Gishboliner, Dhruv Mubayi, Lea Weber Large cliques or cocliques in hypergraphs with forbidden order-size pairs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Mario Correddu, Dario Trevisan On minimum spanning trees for random Euclidean bipartite graphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Olivier Fischer, Raphael Steiner On the choosability of -minor-free graphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Andrzej Grzesik, Daniel Král', Oleg Pikhurko Forcing generalised quasirandom graphs efficiently. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Yassine El Maazouz, Jim Pitman The Bernoulli clock: probabilistic and combinatorial interpretations of the Bernoulli polynomials by circular convolution. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Tom Kelly 0001, Daniela Kühn, Deryk Osthus A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Dmitrii Zakharov On the size of maximal intersecting families. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Matías Pavez-Signé Spanning subdivisions in Dirac graphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Stijn Cambie, Jun Gao 0002, Hong Liu 0010 Many Hamiltonian subsets in large graphs with given density. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Grigoriy Blekherman, Shyamal Patel Threshold graphs maximise homomorphism densities. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Vida Dujmovic, Robert Hickingbotham, Gwenaël Joret, Piotr Micek, Pat Morin, David R. Wood The Excluded Tree Minor Theorem Revisited. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Sahar Diskin, Joshua Erde, Mihyun Kang, Michael Krivelevich Percolation on irregular high-dimensional product graphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Anders Martinsson, Pascal Su Mastermind with a linear number of queries. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Piet Lammers, Fabio Lucio Toninelli Height function localisation on trees. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Jie Han, Jie Hu, Lidan Ping, Guanghui Wang, Yi Wang, Donglei Yang Spanning trees in graphs without large bipartite holes. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1David J. Galvin, Gwen McKinley, Will Perkins 0001, Michail Sarantis, Prasad Tetali On the zeroes of hypergraph independence polynomials. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Lampros Gavalakis Approximate discrete entropy monotonicity for log-concave sums. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Lucas Boczkowski, Igor Shinkar On mappings on the hypercube with small average stretch. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Catherine S. Greenhill, Mikhail Isaev, Tamás Makai, Brendan D. McKay Degree sequences of sufficiently dense random uniform hypergraphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sergey Norin, Alex Scott 0001, David R. Wood Clustered colouring of graph classes with bounded treedepth or pathwidth. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sahar Diskin, Michael Krivelevich Supercritical site percolation on the hypercube: small components are small. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Eoin Long, Laurentiu Ploscaru A bipartite version of the Erdős-McKay conjecture. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Alex Cameron, Emily Heath New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Tao Jiang 0003, Yu Qiu Many Turán exponents via subdivisions. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Elvira Moreno, Mauricio Velasco On random walks and switched random walks on homogeneous spaces. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Cong Luo, Jie Ma 0002, Tianchi Yang On the maximum number of edges in -critical graphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Nina Kamcev, Alp Müyesser Unavoidable patterns in locally balanced colourings. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Ander Lamaison Ramsey upper density of infinite graphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1David Conlon, Rajko Nenadov, Milos Trujic On the size-Ramsey number of grids. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Simon Briend, Francisco Calvillo, Gábor Lugosi Archaeology of random recursive dags and Cooper-Frieze random networks. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Raphael Steiner Improved bound for improper colourings of graphs with no odd clique minor. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1George Andriopoulos Convergence of blanket times for sequences of random walks on critical random graphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Bogdan Nica Polynomials over structured grids. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Luka Milicevic Approximately symmetric forms far from being exactly symmetric. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Simón Piga, Marcelo Tadeu de Sá Oliveira Sales, Bjarne Schülke The codegree Turán density of tight cycles minus one edge. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Luc Devroye, Marcel K. Goh, Rosie Y. Zhao On the peel number and the leaf-height of Galton-Watson trees. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1David de Boer, Pjotr Buys, Guus Regts Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Asaf Ferber, Ashwin Sah, Mehtaab Sawhney, Yizhe Zhu Sparse recovery properties of discrete random matrices. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Ádám Timár Unimodular random one-ended planar graphs are sofic. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Lior Gishboliner, Benny Sudakov Maximal chordal subgraphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Fabrizio Frati, Michael Hoffmann 0001, Csaba D. Tóth Universal geometric graphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Bhaswar B. Bhattacharya, Anirban Chatterjee, Svante Janson Fluctuations of subgraph counts in graphon based random graphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Bjarne Schülke A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sam Spiro A smoother notion of spread hypergraphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan Triangles in randomly perturbed graphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Joel Larsson Danielsson, Klas Markström Polarised random -SAT. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Anurag Bishnoi, Simona Boyadzhiyska, Shagnik Das, Tamás Mészáros 0001 Subspace coverings with multiplicities. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Agelos Georgakopoulos, Christoforos Panagiotis On the exponential growth rates of lattice animals and interfaces. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Noga Alon, Fan Wei Irregular subgraphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1András Mészáros A BK inequality for random matchings. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Joseph Hyde Towards the 0-statement of the Kohayakawa-Kreuter conjecture. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Tom Hutchcroft, Alexander Kent, Petar Nizic-Nikolac The bunkbed conjecture holds in the p\uparrow 1 limit. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Ke Wang 0003, Philip Matchett Wood Limiting empirical spectral distribution for the non-backtracking matrix of an Erdős-Rényi random graph. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Tereza Klimosová, Christian Reiher, Andrzej Rucinski 0001, Matas Sileikis Sandwiching biregular random graphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1James Anderson, Anton Bernshteyn, Abhishek Dhawan Colouring graphs with forbidden bipartite subgraphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1David Conlon, Jacob Fox, Yuval Wigderson Off-diagonal book Ramsey numbers. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1James Foster, Karen Habermann Brownian bridge expansions for Lévy area approximations and particular values of the Riemann zeta function. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Alberto Espuny Díaz, Yury Person Spanning -cycles in random graphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Dingding Dong, Nitya Mani, Yufei Zhao On the number of error correcting codes. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Beka Ergemlidze, Theodore Molla Transversal Ck-factors in subgraphs of the balanced blow-up of Ck. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Bojan Mohar, Hehui Wu Triangle-free subgraphs with large fractional chromatic number. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Antonio Blanca, Alistair Sinclair, Xusheng Zhang The critical mean-field Chayes-Machta dynamics. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Nemanja Draganic, Stefan Glock, Michael Krivelevich Short proofs for long induced paths. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Martin Kurecka Lower bound on the size of a quasirandom forcing set of permutations. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Maria Axenovich, António Girão, Richard Snyder, Lea Weber Strong complete minors in digraphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Ronen Eldan, Dan Mikulincer, Hester Pieters Community detection and percolation of information in a geometric setting. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Markus Heydenreich, Kilian Matzke Expansion for the critical point of site percolation: the first three terms. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Endre Csóka, Lukasz Grabowski On directed analogues of expander and hyperfinite graph sequences. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Catherine S. Greenhill, Mikhail Isaev, Gary Liang Spanning trees in random regular uniform hypergraphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Hariharan Narayanan, Piyush Srivastava 0001 On the mixing time of coordinate Hit-and-Run. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Matthew Jenssen, Will Perkins 0001, Aditya Potukuchi Independent sets of a given size and structure in the hypercube. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Tao Jiang 0003, Jie Ma 0002, Liana Yepremyan On Turán exponents of bipartite graphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Andrea Freschi, Joseph Hyde, Andrew Treglown On deficiency problems for graphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Allan Lo, Andrew Treglown, Yi Zhao 0005 Complete subgraphs in a multipartite graph. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Ryan R. Martin, Alex W. N. Riasanovsky On the edit distance function of the random graph. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Jin-Yi Cai, Artem Govorov Perfect matchings, rank of connection tensors and graph homomorphisms. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Noga Alon, Asaf Nachmias, Matan Shalev The diameter of the uniform spanning tree of dense graphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Tony Huynh, Gwenaël Joret, David R. Wood Subgraph densities in a surface. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Thibaut Lemoine Large N behaviour of the two-dimensional Yang-Mills partition function. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Andrzej Grzesik, Joonkyung Lee, Bernard Lidický, Jan Volec On tripartite common graphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Agelos Georgakopoulos, John Haslegrave, Thomas Sauerwald, John Sylvester 0001 The power of two choices for random walks. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Vida Dujmovic, Louis Esperet, Pat Morin, Bartosz Walczak, David R. Wood Clustered 3-colouring graphs of bounded degree. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Xizhi Liu Hypergraphs without non-trivial intersecting subgraphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Markus Kuba, Alois Panholzer On bucket increasing trees, clustered increasing trees and increasing diamonds. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Sergey G. Bobkov, Arnaud Marsiglietti, James Melbourne Concentration functions and entropy bounds for discrete log-concave distributions. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Asaf Ferber, Vishesh Jain, Yufei Zhao On the number of Hadamard matrices via anti-concentration. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Peter Allen 0001, Julia Böttcher, Julia Ehrenmüller, Jakob Schnitzer, Anusch Taraz A spanning bandwidth theorem in random graphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Vojtech Rödl, Marcelo Tadeu Sales A blurred view of Van der Waerden type theorems. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Maciej Bendkowski, Olivier Bodini, Sergey Dovgal Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Lowell Abrams, Joanna A. Ellis-Monaghan New dualities from old: generating geometric, Petrie, and Wilson dualities and trialities of ribbon graphs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Tobias Johnson Continuous phase transitions on Galton-Watson trees. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Vishesh Jain, Ashwin Sah, Mehtaab Sawhney On the smallest singular value of symmetric random matrices. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Asaf Ferber, Matthew Kwan, Lisa Sauermann Singularity of sparse random matrices: simple proofs. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Umberto De Ambroggio, Matthew I. Roberts Unusually large components in near-critical Erdős-Rényi graphs via ballot theorems. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 1481 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
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