Amir M. Ben-Amram

	2012
47		Amir M. Ben-Amram, Samir Genaim, Abu Naser Masud: On the Termination of Integer Loops. VMCAI 2012: 72-87
46		Amir M. Ben-Amram, Michael Vainer: Bounded Termination of Monotonicity-Constraint Transition Systems CoRR abs/1202.4281: (2012)
45		Amir M. Ben-Amram, Bruno Loff, Isabel Oitavem: Monotonicity Constraints in Characterizations of PSPACE. J. Log. Comput. 22(2): 179-195 (2012)
44		Amir M. Ben-Amram, Simon Yoffe: Corrigendum to "A simple and efficient Union-Find-Delete algorithm" [Theoret. Comput. Sci. 412(4-5) 487-492]. Theor. Comput. Sci. 423: 75 (2012)
	2011
43		Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl: SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers CoRR abs/1107.5980: (2011)
42		Amir M. Ben-Amram: Monotonicity Constraints for Termination in the Integer Domain Logical Methods in Computer Science 7(3): (2011)
41		Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs, Jürgen Giesl: SAT-based termination analysis using monotonicity constraints over the integers. TPLP 11(4-5): 503-520 (2011)
40		Amir M. Ben-Amram, Simon Yoffe: A simple and efficient Union-Find-Delete algorithm. Theor. Comput. Sci. 412(4-5): 487-492 (2011)
	2010
39		Amir M. Ben-Amram: On Decidable Growth-Rate Properties of Imperative Programs DICE 2010: 1-14
38		Amir M. Ben-Amram: Size-Change Termination, Monotonicity Constraints and Ranking Functions Logical Methods in Computer Science 6(3): (2010)
	2009
37		Amir M. Ben-Amram: Size-Change Termination, Monotonicity Constraints and Ranking Functions. CAV 2009: 109-123
36		Amir M. Ben-Amram: A complexity tradeoff in ranking-function termination proofs. Acta Inf. 46(1): 57-72 (2009)
35		Amir M. Ben-Amram: The Euler Path to Static Level-Ancestors CoRR abs/0909.1030: (2009)
34		Amir M. Ben-Amram, Chin Soon Lee: Ranking Functions for Size-Change Termination II Logical Methods in Computer Science 5(2): (2009)
	2008
33		Amir M. Ben-Amram, Neil D. Jones, Lars Kristiansen: Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time. CiE 2008: 67-76
32		Amir M. Ben-Amram, Michael Codish: A SAT-Based Approach to Size Change Termination with Global Ranking Functions. TACAS 2008: 218-232
31		Amir M. Ben-Amram: Size-change termination with difference constraints. ACM Trans. Program. Lang. Syst. 30(3): (2008)
	2007
30		Amir M. Ben-Amram, Chin Soon Lee: Program termination analysis in polynomial time. ACM Trans. Program. Lang. Syst. 29(1): (2007)
	2006
29		Amir M. Ben-Amram, Holger Petersen: Backing up in singly linked lists. J. ACM 53(4): 681-705 (2006)
	2005
28		Amir M. Ben-Amram: The Church-Turing thesis and its look-alikes. SIGACT News 36(3): 113-114 (2005)
	2004
27		Amir M. Ben-Amram: A complexity-theoretic proof of a Recursion-Theoretic Theorem. SIGACT News 35(2): 111-112 (2004)
	2003
26		Amir M. Ben-Amram, Omer Berkman, Holger Petersen: Element distinctness on one-tape Turing machines: a complete solution. Acta Inf. 40(2): 81-94 (2003)
25		Amir M. Ben-Amram: Tighter constant-factor time hierarchies. Inf. Process. Lett. 87(1): 39-44 (2003)
	2002
24		Amir M. Ben-Amram: General Size-Change Termination and Lexicographic Descent. The Essence of Computation 2002: 3-17
23		Amir M. Ben-Amram, Zvi Galil: Lower Bounds for Dynamic Data Structures on Algebraic RAMs. Algorithmica 32(3): 364-395 (2002)
22		Amir M. Ben-Amram, Holger Petersen: Improved Bounds for Functions Related to Busy Beavers. Theory Comput. Syst. 35(1): 1-11 (2002)
	2001
21		Chin Soon Lee, Neil D. Jones, Amir M. Ben-Amram: The size-change principle for program termination. POPL 2001: 81-92
20		Amir M. Ben-Amram, Zvi Galil: A Generalization of a Lower Bound Technique due to Fredman and Saks. Algorithmica 30(1): 34-66 (2001)
19		Amir M. Ben-Amram, Zvi Galil: Topological Lower Bounds on Algebraic Random Access Machines. SIAM J. Comput. 31(3): 722-761 (2001)
	2000
18		Amir M. Ben-Amram, Neil D. Jones: Computational complexity via programming languages: constant factors do matter. Acta Inf. 37(2): 83-120 (2000)
	1999
17		Stephen Alstrup, Amir M. Ben-Amram, Theis Rauhe: Worst-Case and Amortised Optimality in Union-Find (Extended Abstract). STOC 1999: 499-506
16		Amir M. Ben-Amram, Holger Petersen: Backing Up in Singly Linked Lists. STOC 1999: 780-786
15		Amir M. Ben-Amram, Neil D. Jones: A Precise Version of a Time Hierarchy Theorem. Fundam. Inform. 38(1-2): 1-15 (1999)
	1998
14		Amir M. Ben-Amram, Holger Petersen: CONS-Free Programs with Tree Input (Extended Abstract). ICALP 1998: 271-282
13		Amir M. Ben-Amram: Introducing: Reasonable Complete Programming Languages. Bulletin of the EATCS 64: (1998)
	1997
12		Amir M. Ben-Amram: When Can We Sort in o(n log n) Time? J. Comput. Syst. Sci. 54(2): 345-370 (1997)
	1996
11		Amir M. Ben-Amram, Bryant A. Julstrom, Uri Zwick: A Note on Busy Beavers and Other Creatures. Mathematical Systems Theory 29(4): 375-386 (1996)
	1995
10		Amir M. Ben-Amram, Zvi Galil: Lower Bounds on Algebraic Random Access Machines (Extended Abstract). ICALP 1995: 360-371
9		Amir M. Ben-Amram, Zvi Galil: On Data Structure Tradeoffs and an Application to Union-Find Electronic Colloquium on Computational Complexity (ECCC) 2(62): (1995)
8		Amir M. Ben-Amram, Zvi Galil: On the Power of the Shift Instruction Inf. Comput. 117(1): 19-36 (1995)
7		Amir M. Ben-Amram: What is a "pointer machine"? SIGACT News 26(2): 88-95 (1995)
	1994
6		Amir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kunsoo Park: The Subtree Max Gap Problem with Application to Parallel String Covering. SODA 1994: 501-510
5		Amir M. Ben-Amram: Unit-Cost Pointers versus Logarithmic-Cost Addresses. Theor. Comput. Sci. 132(2): 377-385 (1994)
	1993
4		Amir M. Ben-Amram, Zvi Galil: When can we sort in o(n log n) time? FOCS 1993: 538-546
	1992
3		Amir M. Ben-Amram, Zvi Galil: On Pointers versus Addresses. J. ACM 39(3): 617-648 (1992)
	1991
2		Amir M. Ben-Amram, Zvi Galil: Lower Bounds for Data Structure Problems on RAMs (Extended Abstract) FOCS 1991: 622-631
	1988
1		Amir M. Ben-Amram, Zvi Galil: On Pointers versus Addresses (Extended Abstract) FOCS 1988: 532-538

Coauthor Index

1	Stephen Alstrup	[17]
2	Omer Berkman	[6] [26]
3	Michael Codish	[32] [41] [43]
4	Carsten Fuhs	[41] [43]
5	Zvi Galil	[1] [2] [3] [4] [8] [9] [10] [19] [20] [23]
6	Samir Genaim	[47]
7	Jürgen Giesl	[41] [43]
8	Igor Gonopolskiy	[41] [43]
9	Costas S. Iliopoulos	[6]
10	Neil D. Jones	[15] [18] [21] [33]
11	Bryant A. Julstrom	[11]
12	Lars Kristiansen	[33]
13	Chin Soon Lee	[21] [30] [34]
14	Bruno Loff	[45]
15	Abu Naser Masud	[47]
16	Isabel Oitavem	[45]
17	Kunsoo Park	[6]
18	Holger Petersen	[14] [16] [22] [26] [29]
19	Theis Rauhe	[17]
20	Michael Vainer	[46]
21	Simon Yoffe	[40] [44]
22	Uri Zwick	[11]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page