Uri N. Peled - Concepedia

Author

Uri N. Peled

University of Illinois Chicago

Also Known As

Peled, Uri N., U N Peled, U. N. Peled, U.N Peled, U.N. Peled, URI PELED, Udi Peled, Uri N. Peled, Uri Peled

Publications

1.2K

Citations

H-Index

Concepts

All Affiliations

University of Illinois Chicago Sapienza University of Rome Northeastern University Ben-Gurion University of the Negev Rutgers, The State University of New Jersey

About

Uri N. Peled is an author at University of Illinois Chicago specializing in discrete mathematics, graph theory, and engineering.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	12	15	618
2	Education	5	5	105
3	Computer Engineering	2	2	49
4	Business	1	1	13
5	Management	1	1	19

Uri N. Peled

Publications

Citations

H-Index

Page 1

	Year	Citations
Facet of regular 0–1 polytopes P. L. Hammer, E. L. Johnson, Uri N. Peled Mathematical Programming Discrete GeometryEngineeringRegular 0–1Computational GeometryOriented Matroids	1975	168
Difference graphs Peter L. Hammer, Uri N. Peled, Xiaorong Sun Discrete Applied Mathematics	1990	106
Polynomial-time algorithms for regular set-covering and threshold synthesis Uri N. Peled, Bruno Simeone Discrete Applied Mathematics Mathematical ProgrammingComputational Complexity TheoryEngineeringCombinatorial ProblemAlgorithmic Efficiency	1985	86
On the First Eigenvalue of Bipartite Graphs Amitava Bhattacharya, Shmuel Friedland, Uri N. Peled The Electronic Journal of Combinatorics Graph MinorTotal UnimodularityGraph TheoryAlgebraic Graph TheoryStructural Graph Theory	2008	85
Explicit Construction of Families of LDPC Codes With No&lt;tex&gt;$4$&lt;/tex&gt;-Cycles J.-L. Kim, Uri N. Peled, I.G. Perepelitsa, IEEE Transactions on Information Theory Minimum Stopping SetEngineeringGraph TheoryError Correction CodeIterative Decoding	2004	85
Theory of computation of multidimensional entropy with an application to the monomer–dimer problem Shmuel Friedland, Uri N. Peled Advances in Applied Mathematics EngineeringInformation TheoryEntropyEntropy ProductionMonomer–dimer Problem	2004	55
(n,e)-Graphs with maximum sum of squares of degrees* Uri N. Peled, Rossella Petreschi, Andrea Sterbini Journal of Graph Theory Graph MinorNetwork ScienceGraph TheoryEngineeringAlgebraic Graph Theory	1999	42
The polytope of degree sequences Uri N. Peled, Murali K. Srinivasan Linear Algebra and its Applications Discrete GeometryAlgebraic CombinatoricsDegree SequencesTopological CombinatoricsDiscrete Mathematics	1989	39
An O(nm)-time algorithm for computing the dual of a regular Boolean function Uri N. Peled, Bruno Simeone Discrete Applied Mathematics Circuit ComplexityMathematical ProgrammingLogic SynthesisRegular Boolean FunctionEngineering	1994	37
On the Maximization of a Pseudo-Boolean Function Peter L. Hammer, Uri N. Peled Journal of the ACM	1972	29

Page 1