You are viewing a javascript disabled version of the site. Please enable Javascript for this site to function properly.
Go to headerGo to navigationGo to searchGo to contentsGo to footer
In content section. Select this link to jump to navigation

Author Index Volume 6 (2017)

Cholak, P. and R. Epstein, Computably enumerable sets that are automorphic to low sets (1) 23–45

Cui, C., see Ibarra, O.H. (2) 165–181

Dang, Z., see Ibarra, O.H. (2) 165–181

Dzhafarov, D.D. and G. Igusa, Notions of robust information coding (2) 105–124

Epstein, R., see Cholak, P. (1) 23–45

Fischer, T.R., see Ibarra, O.H. (2) 165–181

Gonen, R. and A. Lerner, Characterizing incentive compatible, Pareto optimal and sufficiently anonymous constrained combinatorial mechanisms – Two players case (2) 183–208

Huschenbett, M., A. Kartzow and P. Schlicht, Pumping for ordinal-automatic structures (2) 125–164

Ibarra, O.H., C. Cui, Z. Dang and T.R. Fischer, Lossiness of communication channels modeled by transducers (2) 165–181

Igusa, G., see Dzhafarov, D.D. (2) 105–124

Jain, S., F. Stephan and J. Teutsch, Closed left-r.e. sets (1) 1–21

Kartzow, A., see Huschenbett, M. (2) 125–164

Lerner, A., see Gonen, R. (2) 183–208

Patey, L., Controlling iterated jumps of solutions to combinatorial problems (1) 47–78

Schlicht, P., see Huschenbett, M. (2) 125–164

Stephan, F., see Jain, S. (1) 1–21

Teutsch, J., see Jain, S. (1) 1–21

Weihrauch, K., Computability on measurable functions (1) 79–104