Oscar Levin

According to our database, Oscar Levin authored at least 7 papers between 2010 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2022

The computational strength of matchings in countable graphs.

Stephen Flood, Matthew Jura, Oscar Levin, Tyler Markkanen

Ann. Pure Appl. Log., 2022

2016

Computing Planarity in Computable Planar Graphs.

Oscar Levin, Taylor McMillan

Graphs Comb., 2016

A-computable graphs.

Matthew Jura, Oscar Levin, Tyler Markkanen

Ann. Pure Appl. Log., 2016

Computable dimension for ordered fields.

Oscar Levin

Arch. Math. Log., 2016

2015

Finding Domatic Partitions in Infinite Graphs.

Matthew Jura, Oscar Levin, Tyler Markkanen

Electron. J. Comb., 2015

2014

Domatic partitions of computable graphs.

Matthew Jura, Oscar Levin, Tyler Markkanen

Arch. Math. Log., 2014

2010

Embeddings of Computable Structures.

Asher M. Kach, Oscar Levin, Reed Solomon

Notre Dame J. Formal Log., 2010